Abstract
We consider the problem of designing an algorithm for constructing a triangulation associated with a given set of points in the plane. In discussing general features of such algorithms, we pay special attention to the choice of an optimality criterion, and to the complexity of competing algorithms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
