Loading...
Please wait, while we are loading the content...
A new algorithm for finding polygonal voids in Delaunay triangulations and its parallelization
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ojeda, José Alonso, Rodrigo Hitschfeld-Kahler, Nancy |
| Copyright Year | 2018 |
| Abstract | A known geometrical problem is to find low density zones (voids) in planar point sets and to represent them as polygons. In this paper we recall the concept of terminal-edge region to identify subvoid candidates over a triangulation, present a linear algorithm to find subvoids taking as input a Delaunay triangulation, and show that this new strategy can be naturally parallelized using GPU computing. We also show preliminary experimental results. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://conference.imp.fu-berlin.de/eurocg18/download/paper_56.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |