A fast algorithm for an envelope construction of a huge set of topologically consistent polygons

DOI10.1007/S00366-002-0247-6zbMATH Open1080.65014OpenAlexW2109753383MaRDI QIDQ2575283FDOQ2575283

Authors: Borut Žalik 

Publication date: 8 December 2005

Published in: Engineering with Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00366-002-0247-6

Recommendations

• A topology construction from line drawings using a uniform plane subdivision technique.
• A simple algorithm for determining the envelope of a set of lines
• Reassembling polygons from edges
• The contour problem for rectilinear polygons
• The convex hull of a set of convex polygons

zbMATH Keywords

algorithmcomputational geometrygraphical examplesgeographic information systemsenvelope of polygonstwo-level uniform plane subdivision

Mathematics Subject Classification ID

Geodesy, mapping problems (86A30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (3)

• A topology construction from line drawings using a uniform plane subdivision technique.
• Improving dissolve spatial operations in a simple feature model
• Reassembling polygons from edges

This page was built for publication: A fast algorithm for an envelope construction of a huge set of topologically consistent polygons

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