Reassembling polygons from edges

DOI10.1080/00207168908803695MaRDI QIDQ4207578zbMATH OpenOpenAlexFDO

Authors Richard I. Hartley

Publication date 1989

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168908803695

zbMATH Keywords

computational geometryplane-sweep algorithmderived polygonspace- efficient algorithm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The contour problem for rectilinear polygons
• A fast algorithm for an envelope construction of a huge set of topologically consistent polygons
• Reporting Intersections of Polygons
• Topologically sweeping an arrangement
• The convex hull of a set of convex polygons

Cites work

• Plane-sweep algorithms for intersecting geometric figures

Cited in

(2)

• A fast algorithm for an envelope construction of a huge set of topologically consistent polygons
• Reconstruction of Weakly Simple Polygons from Their Edges

This page was built for publication: Reassembling polygons from edges

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