278 search results - page 25 / 56 » Discrete Approximations to Continuous Curves |
SIGGRAPH
1996
ACM
14 years 18 days ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
CCCG
2007
13 years 10 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
CVPR
2004
IEEE
14 years 5 days ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
PAMI
2010
13 years 6 months ago
2010
—Representative surface reconstruction algorithms taking a gradient field as input enforces the integrability constraint in a discrete manner. While enforcing integrability allo...
AIPS
2006
13 years 9 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...