303 search results - page 37 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
APVIS
2008
13 years 9 months ago
2008
We present a technique for memory-efficient and time-efficient volume rendering of curvilinear adaptive mesh refinement data defined within extrudable computational spaces. One of...
CATS
2007
13 years 9 months ago
2007
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
A central problem in the analysis of motion capture (Mo-
Cap) data is how to decompose motion sequences into primitives.
Ideally, a description in terms of primitives should
fac...
CCCG
2009
13 years 8 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
SIGGRAPH
1993
ACM
13 years 11 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...