COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME

DOI10.1142/S0218195999000054zbMath1020.52013OpenAlexW2110595174MaRDI QIDQ4513231

Jack Scott Snoeyink, David G. Kirkpatrick

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/s0218195999000054

zbMATH Keywords

shortest transversalbinary search on convex polygons

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Nonlinear programming (90C30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

A compact piecewise-linear Voronoi diagram for convex sites in the plane

Cites Work

• Computing shortest transversals
• Fast detection of polyhedral intersection
• Maintenance of configurations in the plane
• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• Computing the extreme distances between two convex polygons

This page was built for publication: COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME