Abstract
We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constrained Delaunay triangulation based on the use of regular triangulation. As far as we know, such a connection has not been presented yet in the literature and there is no algorithm based on this idea, too. This work also serves as a spring-board to higher dimensions.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have