Skip to main content
Article thumbnail
Location of Repository

Computing Delaunay Triangulation with Imprecise . . .

By A. A. Khanban and A. Edalat

Abstract

The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside oroutside the circle determined by any other three points. We address the problem of formulating the in-circle testwhen the coordinates of the planar points are given only up to a given precision, which is usually the case in practice. By modelling imprecise points as rectangles, and using the idea of partial disc, we construct a reliablein-circle test that provides the best possible Delaunay triangulation with the imprecise input data given by rectangles

Topics: robust algorithm, Delaunay triangulation, imprecise data, in-circle test, partial disc
Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.3770
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.dal.ca/~cccg/pap... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.