Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)

DOI10.1007/3-540-63307-3_59zbMath1497.68524OpenAlexW1506127582MaRDI QIDQ5096937

Giuseppe Liotta, Olivier Devillers, Roberto Tamassia, Franco P. Preparata

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_59

zbMATH Keywords

convex polygonVoronoi diagramplanar graphDelaunay triangulationconvex polytopes

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximation behavior of the greedy triangulation for convex polygons
• Establishing order in planar subdivisions
• Triangulating a simple polygon in linear time
• Checking geometric programs or verification of geometric structures
• 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

This page was built for publication: Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)