Skip to main content

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

Download / Buy Article:

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.

Proceed

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

Document Type: Research Article

DOI: http://dx.doi.org/10.1016/S0965-9978(00)00096-X

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

Publication date: May 1, 2001

els/09659978/2001/00000032/00000005/art00096
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

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
X
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