7351 search results - page 305 / 1471 » Segmenting Point Sets |
175
click to vote
JCO
2008
15 years 6 months ago
2008
We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.
192
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
184
click to vote
ICDAR
2009
IEEE
16 years 1 months ago
2009
IEEE
This communication presents an effective method for writer recognition in handwritten documents. We have introduced a set of features that are extracted from the contours of handw...
178
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
153
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...