Delaunay and Voronoi tessellations and minimal simple cycles in triangular region and regular-3 undirected planar graphs

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.


Download / Buy Article:

Keywords: Computational Geometry; Delaunay and Voronoi tessellations; Graph algorithms

Document Type: Research Article


Affiliations: Department of Mechanical and Chemical Engineering, Heriot-Watt University, , Edinburgh, UK

Publication date: May 1, 2001

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more