Checking the convexity of polytopes and the planarity of subdivisions
- 1 December 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 11 (3-4) , 187-208
- https://doi.org/10.1016/s0925-7721(98)00039-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Robust proximity queriesPublished by Association for Computing Machinery (ACM) ,1997
- Angles of Planar Triangular GraphsSIAM Journal on Discrete Mathematics, 1996
- Designing programs that check their workJournal of the ACM, 1995
- On-line convex planarity testingPublished by Springer Nature ,1995
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991
- Establishing order in planar subdivisionsDiscrete & Computational Geometry, 1988
- On approximation behavior of the greedy triangulation for convex polygonsAlgorithmica, 1987
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Efficient Planarity TestingJournal of the ACM, 1974
- A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 1937