Sciweavers

2255 search results - page 172 / 451
» Computing a Center-Transversal Line
Sort
View
143
Voted
DCG
2008
86views more  DCG 2008»
15 years 3 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
122
Voted
CGF
2007
156views more  CGF 2007»
15 years 3 months ago
QuadCover - Surface Parameterization using Branched Coverings
We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, f...
Felix Kälberer, Matthias Nieser, Konrad Polth...
HRI
2011
ACM
14 years 7 months ago
Learning to interpret pointing gestures with a time-of-flight camera
Pointing gestures are a common and intuitive way to draw somebody’s attention to a certain object. While humans can easily interpret robot gestures, the perception of human beha...
David Droeschel, Jörg Stückler, Sven Beh...
MFCS
1993
Springer
15 years 7 months ago
Real Number Computability and Domain Theory
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
Pietro Di Gianantonio
141
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 3 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...