Drawing the planar dual

DOI10.1016/0020-0190(92)90022-NzbMath0768.68201OpenAlexW2006448585MaRDI QIDQ1198002

John R. Gilbert, Marshall W. Bern

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90022-n

zbMATH Keywords

mesh generationNP-hardplanar graphcomputational geometryplanar embeddinglinear-time algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Nonobtuse triangulations of PSLGs, On simultaneous planar graph embeddings, Converting triangulations to quadrangulations, QUADRILATERAL MESHING BY CIRCLE PACKING

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rectilinear planar layouts and bipolar orientations of planar graphs
• On non-intersecting Eulerian circuits
• Nonobtuse triangulation of polygons
• Planarity and duality of finite and infinite graphs
• Planar Formulae and Their Uses
• How to Draw a Graph
• Convex Maps