Sciweavers

584 search results - page 59 / 117
» On the Number of Halving Planes
Sort
View
COMGEO
2011
ACM
14 years 5 months ago
A computational approach to Conway's thrackle conjecture
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
Radoslav Fulek, János Pach
COMPGEOM
2005
ACM
14 years 12 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
MVA
2000
164views Computer Vision» more  MVA 2000»
14 years 11 months ago
Visual Screen: Transforming an Ordinary Screen into a Touch Screen
Touch screens are very convenient because one can directly point to where it is interesting. This paper presents an inexpensive technique to transform an ordinary screen into a to...
Zhengyou Zhang, Ying Shan
CORR
2011
Springer
164views Education» more  CORR 2011»
14 years 5 months ago
Sweeping an oval to a vanishing point
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by ...
Adrian Dumitrescu, Minghui Jiang
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
15 years 4 months ago
Piercing Translates and Homothets of a Convex Body
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
Adrian Dumitrescu, Minghui Jiang