A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
From MaRDI portal
(Redirected from Publication:4682177)
Recommendations
Cites work
- A computational basis for higher-dimensional computational geometry and applications
- A New Approach to Planar Point Location
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- A paradigm for robust geometric algorithms
- A probabilistic analysis of the power of arithmetic filters
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Applied computational geometry: Towards robust solutions of basic problems
- Checking geometric programs or verification of geometric structures
- Checking the convexity of polytopes and the planarity of subdivisions
- Designing programs that check their work
- Efficient algorithms for line and curve segment intersection using restricted predicates
- Evaluating signs of determinants using single-precision arithmetic
- Finding the intersection of two convex polyhedra
- Fractional cascading. I: A data structuring technique
- Fractional cascading. II: Applications
- Location of a Point in a Planar Subdivision and Its Applications
- Maintenance of a minimum spanning forest in a dynamic plane graph
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
- On-line Planar Graph Embedding
- Optimal Point Location in a Monotone Subdivision
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Robust Plane Sweep for Intersecting Segments
- Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
- Self-testing/correcting with applications to numerical problems
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Towards exact geometric computation
Cited in
(10)- Using generic programming for designing a data structure for polyhedral surfaces
- A workbench for computational geometry
- Advanced programming techniques applied to CGAL's arrangement package
- scientific article; zbMATH DE number 176582 (Why is no real title available?)
- scientific article; zbMATH DE number 1241855 (Why is no real title available?)
- On the design of CGAL a computational geometry algorithms library
- Reliable and Efficient Geometric Computing
- Automated Deduction in Geometry
- scientific article; zbMATH DE number 2247829 (Why is no real title available?)
- Applications of computational geometry in mechanical engineering design and manufacture
This page was built for publication: A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682177)
