Sciweavers

109 search results - page 6 / 22
» Computing the betti numbers of arrangements
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
COMGEO
2007
ACM
13 years 7 months ago
An intersection-sensitive algorithm for snap rounding
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
Mark de Berg, Dan Halperin, Mark H. Overmars
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Quantifying Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
Chao Chen, Daniel Freedman
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
13 years 7 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
CHI
2010
ACM
14 years 2 months ago
Lumino: tangible blocks for tabletop computers based on glass fiber bundles
Tabletop computers based on diffuse illumination can track fiducial markers placed on the table’s surface. In this paper, we demonstrate how to do the same with objects arranged...
Patrick Baudisch, Torsten Becker, Frederik Rudeck