102291 search results - page 392 / 20459 » Computability in Computational Geometry |
207
click to vote
COMPGEOM
1996
ACM
15 years 11 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
181
click to vote
COMPGEOM
1993
ACM
15 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
175
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
165
Voted
3DPVT
2004
IEEE
15 years 10 months ago
2004
IEEE
Helmholtz Stereopsis (HS) has recently been explored as a promising technique for capturing shape of objects with unknown reflectance. So far, it has been widely applied to object...
198
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...