FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE

DOI10.1142/S0218195905001750zbMath1104.68118OpenAlexW2152911085MaRDI QIDQ5694056

Theocharis Malamatos, Rahul Ray, Stefan Funke

Publication date: 29 September 2005

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

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

zbMATH Keywords

triangulated irregular network

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (2)

FITTING FLATS TO POINTS WITH OUTLIERS ⋮ Enclosing weighted points with an almost-unit ball

Uses Software

• LEDA

Cites Work

• On a circle placement problem
• Exact and approximation algorithms for clustering
• Computing large planar regions in terrains, with an application to fracture surfaces
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Maintenance of a minimum spanning forest in a dynamic plane graph

This page was built for publication: FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE