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

DOI10.1007/S00366-002-0247-6zbMath1080.65014OpenAlexW2109753383MaRDI QIDQ2575283

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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