2980 search results - page 219 / 596 » Computational Geometry |
150
click to vote
JCDCG
2004
Springer
16 years 2 hour ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
166
click to vote
3DIM
2003
IEEE
15 years 12 months ago
2003
IEEE
We examine the problem of editing complex 3D objects. We convert the problem of editing a 3D object of arbitrary size and surface properties to a problem of editing a 2D image. We...
182
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
167
click to vote
COMPGEOM
1999
ACM
15 years 11 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
157
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...