Dewall: a Fast Divide & Conquer Delaunay T Riangulation Algorithm in E


The paper deals with Delaunay Triangulations (DT) in E space. This classic computational geometry problem is studied from the point of view of the e ciency, extendibility to any dimensionality, and ease of implementation. A new solution to DT is proposed, based on an original interpretation of the wellknown Divide and Conquer paradigm. One of the main… (More)


10 Figures and Tables

Slides referencing similar topics