Sciweavers

330 search results - page 35 / 66
» Isosurfacing in higher dimensions
Sort
View
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 7 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
MCS
2007
Springer
13 years 7 months ago
Nonlinearity from linearity: The Ermakov-Pinney equation revisited
In this short note, we revisit the so-called Ermakov–Pinney (EP) equation viewing its properties from a physically motivated perspective. We discuss its ties with the Schr¨odin...
Panayotis G. Kevrekidis, Yannis Drossinos
CGF
2000
81views more  CGF 2000»
13 years 7 months ago
Generating Consistent Motion Transition via Decoupled Framespace Interpolation
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
Golam Ashraf, Kok Cheong Wong
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
13 years 7 months ago
Non-Repetitive Tilings
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
James D. Currie, Jamie Simpson
CORR
1999
Springer
84views Education» more  CORR 1999»
13 years 7 months ago
Finding an ordinary conic and an ordinary hyperplane
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
Olivier Devillers, Asish Mukhopadhyay