947 search results - page 118 / 190 » Discrete Geometry |
184
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
160
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
206
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
146
click to vote
COMPGEOM
1995
ACM
15 years 10 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...
149
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...