31 search results - page 2 / 7 » How Good are Convex Hull Algorithms |
COMPGEOM
2001
ACM
13 years 9 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
WADS
2009
Springer
14 years 6 days ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
ESA
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
IPCO
2010
13 years 7 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
ALGORITHMICA
1999
13 years 5 months ago
1999
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...