14 search results - page 2 / 3 » The Expected Extremes in a Delaunay Triangulation |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
151
click to vote
OA
1989
15 years 1 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
COMPGEOM
1993
ACM
15 years 1 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
CSDA
2007
14 years 9 months ago
2007
In this paper we study the problem of bivariate density estimation. The aim is to find a density function with the smallest number of local extreme values which is adequate with ...