Reconstructing domain boundaries within a given set of points, using Delaunay triangulation

Authors:
Ivana Kolingerová;Borut alik
Affiliations:
Centre of Computer Graphics and Visualization, University of West Bohemia, Plzeň, Czech Republic;Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia
Venue:
Computers & Geosciences
Year:
2006

Citing 6
Cited 5

A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

SCG '86 Proceedings of the second annual symposium on Computational geometry
Three-dimensional alpha shapes

ACM Transactions on Graphics (TOG)
A comparison of sequential Delaunay triangulation algorithms

Proceedings of the eleventh annual symposium on Computational geometry
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
A simple provable algorithm for curve reconstruction

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Curve reconstruction: connecting dots with good reason

Computational Geometry: Theory and Applications

Generating and updating multiplicatively weighted Voronoi diagrams for point, line and polygon features in GIS

Computers & Geosciences
Eliminating contour line artefacts by using constrained edges

Computers & Geosciences
Querying streaming point clusters as regions

Proceedings of the ACM SIGSPATIAL International Workshop on GeoStreaming
A new region growing algorithm for triangular mesh recovery from scattered 3D points

Transactions on edutainment VI
A density-based spatial clustering algorithm considering both spatial proximity and attribute similarity

Computers & Geosciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an input set of planar points, which occupy a non-convex polygon area, possibly with holes, we reconstruct the shape of its boundary domain, without previous knowledge of which points or edges belong to the boundary. Our approach is based on different qualities of the Delaunay triangles inside and outside the domain. This method is heuristic and does not ensure success in all cases but it is very simple and there is no other method for this problem known to us. The method was derived on real GIS data but experiments show that it could also be used for mechanical engineering data, with positive results.