Loading...
Loading...

Go to the content (press return)

An incremental algorithm based on edge swapping for constructing restricted Delaunay triangulations

Author
Vigo, M.
Type of activity
Report
Date
1995-12
Repository
http://hdl.handle.net/2117/82481 Open in new window
Abstract
This work presents an algorithm that given a generalized planar graph obtains its Constrained Delaunay Triangulation (CDT). The proposed method works incrementally based in two procedures, one that inserts a new point in a CDT, and another one that inserts a new constraining edge in the CDT. In particular, an algorithm that obtains the CDT of a given polygon (possibly with holes) is obtained. These algorithms have been implemented and included in several applications, showing their robustness an...
Citation
Vigo, M. "An incremental algorithm based on edge swapping for constructing restricted Delaunay triangulations". 1995.
Group of research
CREB - Biomedical Engineering Research Centre
GIE - Engineering Informatics Group

Participants

Attachments