Sciweavers

73 search results - page 4 / 15
» Time Convex Hull with a Highway
Sort
View
ESA
2008
Springer
94views Algorithms» more  ESA 2008»
13 years 9 months ago
Relative Convex Hulls in Semi-dynamic Subdivisions
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
Mashhood Ishaque, Csaba D. Tóth
CCCG
2009
13 years 8 months ago
New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Lin
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
Wenqi Ju, Jun Luo
COMPGEOM
2005
ACM
13 years 9 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
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...
Jonathan Richard Shewchuk
COMPGEOM
1995
ACM
13 years 11 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
ICCSA
2004
Springer
14 years 22 days ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...