Drawing the planar dual

DOI10.1016/0020-0190(92)90022-NMaRDI QIDQ1198002zbMATH OpenOpenAlexFDO

Authors J. R. Gilbert, M. 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

computational geometryNP-hardplanar graphlinear-time algorithmmesh generationplanar embedding

Mathematics Subject Classification ID

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

Recommendations

• Planarity and duality
• scientific article; zbMATH DE number 1693555
• Drawing planar graphs
• Algorithms and Computation
• scientific article; zbMATH DE number 975400
• Plane integral drawings of planar graphs
• Planar diagrams
• On Planar Polyline Drawings
• Rectangular duals of planar graphs
• On plane drawings of 2-planar graphs

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 3509333 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Convex Maps
• How to Draw a Graph
• Nonobtuse triangulation of polygons
• On non-intersecting Eulerian circuits
• Planar Formulae and Their Uses
• Planarity and duality of finite and infinite graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs

Cited in

(5)

• QUADRILATERAL MESHING BY CIRCLE PACKING
• Nonobtuse triangulations of PSLGs
• On simultaneous planar graph embeddings
• Converting triangulations to quadrangulations
• Embedding the dual complex of hyper-rectangular partitions

This page was built for publication: Drawing the planar dual

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198002)