Checking the convexity of polytopes and the planarity of subdivisions
From MaRDI portal
Publication:1276945
DOI10.1016/S0925-7721(98)00039-XzbMath0921.68101MaRDI QIDQ1276945
Olivier Devillers, Giuseppe Liotta, Roberto Tamassia, Franco P. Preparata
Publication date: 11 April 1999
Published in: Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING, Triangulations of Line Segment Sets in the Plane, Certifying algorithms, Efficient authenticated data structures for graph connectivity and geometric search problems, Constructing convex 3-polytopes from two triangulations of a polygon, An efficient local approach to convexity testing of piecewise-linear hypersurfaces, Pipelined algorithms to detect cheating in long-term grid computations, Triangulations in CGAL
Cites Work
- Unnamed Item
- Unnamed Item
- Towards exact geometric computation
- On approximation behavior of the greedy triangulation for convex polygons
- Establishing order in planar subdivisions
- Triangulating a simple polygon in linear time
- Parallel concepts in graph theory
- Incremental convex planarity testing
- Algorithms for Reporting and Counting Geometric Intersections
- Efficient Planarity Testing
- Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
- Designing programs that check their work
- Certification of computational results
- Angles of Planar Triangular Graphs