Sciweavers

90 search results - page 7 / 18
» Formalizing complex plane geometry
Sort
View
COMPGEOM
2003
ACM
15 years 2 months ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
78
Voted
IJCV
2006
116views more  IJCV 2006»
14 years 9 months ago
Contextual Inference in Contour-Based Stereo Correspondence
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
Gang Li, Steven W. Zucker
COMPGEOM
2000
ACM
15 years 2 months ago
Look - a Lazy Object-Oriented Kernel for geometric computation
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
Stefan Funke, Kurt Mehlhorn
COMPGEOM
2005
ACM
14 years 11 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook