- Authors:
- Yi Chiang,
- Roberto Tamassia
Research on dynamic algorithms for geometric problems has received increasing attention in the last years and is motivated by many important applications in circuit layout, computer graphics, and computer-aided design. In this paper we survey dynamic algorithms and data structures in the area of computational geometry. Our work has a twofold purpose: it introduces the area to the nonspecialist and overviews the state-of-the-art for the specialist.
Cited By
- Katz M, Lev-Tov N and Morgenstern G (2012). Conflict-Free Coloring of points on a line with respect to a set of intervals, Computational Geometry: Theory and Applications, 45:9, (508-514), Online publication date: 1-Nov-2012.
Nekrich Y A data structure for multi-dimensional range reporting Proceedings of the twenty-third annual symposium on Computational geometry, (344-353)- Kohli P and Torr P Measuring uncertainty in graph cut solutions – efficiently computing min-marginal energies using dynamic graph cuts Proceedings of the 9th European conference on Computer Vision - Volume Part II, (30-43)
- Nekrich Y Space efficient dynamic orthogonal range reporting Proceedings of the twenty-first annual symposium on Computational geometry, (306-313)
- Mortensen C Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (618-627)
- Wang B, Zhang W and Kitsuregawa M Design of B+tree-based predicate index for efficient event matching Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications, (548-559)
- Reif J and Tate S Dynamic algebraic algorithms Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (290-301)
- Chiang Y and Tamassia R Dynamization of the trapezoid method for planar point location (extended abstract) Proceedings of the seventh annual symposium on Computational geometry, (61-70)
Recommendations
Proving Computational Geometry Algorithms in TLA+2
TASE '11: Proceedings of the 2011 Fifth International Conference on Theoretical Aspects of Software EngineeringGeometric algorithms are widely used in many scientific fields like computer vision, computer graphics. To guarantee the correctness of these algorithms, it's important to apply formal method to them. In this paper, we propose an approach to proving the ...
Recent Advances in Computational Conformal Geometry
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIIIComputational conformal geometry focuses on developing the computational methodologies on discrete surfaces to discover conformal geometric invariants. In this work, we briefly summarize the recent developments for methods and related applications in ...