Sciweavers

4761 search results - page 101 / 953
» Generalizing Boundary Points
Sort
View
COMGEO
2006
ACM
13 years 8 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
MIR
2006
ACM
354views Multimedia» more  MIR 2006»
14 years 2 months ago
Constant tangential angle elected interest points
This paper presents a new interest points detector whose goal is to better catch visual attention than standard detectors. It is based on the generalization of Loy and Zelinsky tr...
Ahmed Rebai, Alexis Joly, Nozha Boujemaa
GBRPR
2005
Springer
14 years 1 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
13 years 8 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld
DM
2011
191views Education» more  DM 2011»
13 years 3 months ago
Notes on lattice points of zonotopes and lattice-face polytopes
Minkowski’s second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowsk...
Christian Bey, Martin Henk, Matthias Henze, Eva Li...