Computational Geometry Column 34

DOI10.1142/S021819599800031XMaRDI QIDQ4513228zbMATH OpenOpenAlexFDO

Authors Joseph O'Rourke, Pankaj K. Agarwal

Publication date 7 November 2000

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021819599800031x

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computational Geometry Column 33
• Computational Geometry Column 31
• Computational Geometry Column 32
• COMPUTATIONAL GEOMETRY COLUMN 46
• Computational geometry column 40
• COMPUTATIONAL GEOMETRY COLUMN 47
• COMPUTATIONAL GEOMETRY COLUMN 48
• COMPUTATIONAL GEOMETRY COLUMN 13
• COMPUTATIONAL GEOMETRY COLUMN 45
• COMPUTATIONAL GEOMETRY COLUMN 24

Cites work

• A lower bound on the number of unit distances between the vertices of a convex polygon
• A survey of Sylvester's problem and its generalizations
• Designing Least-Cost Nonblocking Broadband Networks
• Separation for boundary to CSG conversion
• The maximum number of unit distances in a convex n-gon

Cited in

(5)

• COMPUTATIONAL GEOMETRY COLUMN 11
• Computational Geometry Column 31
• Computational Geometry Column 33
• COMPUTATIONAL GEOMETRY COLUMN 48
• COMPUTATIONAL GEOMETRY COLUMN 47

This page was built for publication: Computational Geometry Column 34

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