Sciweavers

1672 search results - page 1 / 335
» Tightness problems in the plane
Sort
View
DM
1999
70views more  DM 1999»
13 years 6 months ago
Tightness problems in the plane
Bernardo M. Ábrego, Jorge L. Arocha, Silvia...
CSC
2006
13 years 7 months ago
Minimal Enclosing Circle and Two and Three Point Partition of a Plane
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
Felix Friedman
CVPR
2012
IEEE
11 years 8 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
GC
2011
Springer
12 years 9 months ago
A Note on the Complexity of Real Algebraic Hypersurfaces
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
Michael Kerber, Michael Sagraloff
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
13 years 10 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle