A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING

DOI10.1142/S0218195901000390zbMath1074.68656OpenAlexW2104539306MaRDI QIDQ4682177

Roberto Tamassia, Luca Vismara

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000390

zbMATH Keywords

Algorithm engineeringpoint locationgeometric computingsoftware libraries

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• CGAL
• GraphBase

Cites Work

• Evaluating signs of determinants using single-precision arithmetic
• Towards exact geometric computation
• Applied computational geometry: Towards robust solutions of basic problems
• Fractional cascading. I: A data structuring technique
• Fractional cascading. II: Applications
• A paradigm for robust geometric algorithms
• Finding the intersection of two convex polyhedra
• A computational basis for higher-dimensional computational geometry and applications
• A probabilistic analysis of the power of arithmetic filters
• Checking the convexity of polytopes and the planarity of subdivisions
• Checking geometric programs or verification of geometric structures
• Self-testing/correcting with applications to numerical problems
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• Efficient algorithms for line and curve segment intersection using restricted predicates
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• A new point-location algorithm and its practical efficiency: comparison with existing algorithms
• Optimal Point Location in a Monotone Subdivision
• A New Approach to Planar Point Location
• Maintenance of a minimum spanning forest in a dynamic plane graph
• Location of a Point in a Planar Subdivision and Its Applications
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• Designing programs that check their work
• NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
• On-line Planar Graph Embedding
• Robust Plane Sweep for Intersecting Segments

This page was built for publication: A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING