7351 search results - page 32 / 1471 » Segmenting Point Sets |
CCCG
2008
13 years 10 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...
CAGD
2010
13 years 6 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper we propose a new framework to simultaneously segment and register lung and tumor in serial CT data. Our method assumes nonrigid transformation on lung deformation an...
ISDA
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we present a novel approach for face recognition and authentication based on dimensional surface matching. While most of existing methods use facial intensity image...