141 search results - page 5 / 29 » Self-improving Algorithms for Convex Hulls |
125
Voted
IWCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
137
click to vote
ISAAC
2007
Springer
16 years 6 min ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
155
click to vote
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
151
click to vote
COMPGEOM
1991
ACM
15 years 9 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
187
click to vote
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...