1387 search results - page 86 / 278 » Convexity in Discrete Space |
158
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
138
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by perform...
142
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
166
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
139
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Many computer vision applications such as image filtering, segmentation and stereo-vision can be formulated as optimization problems.Whereas in previous decades continuousdomain, ...