Sciweavers

2342 search results - page 256 / 469
» Sublinear geometric algorithms
Sort
View
TVCG
2012
176views Hardware» more  TVCG 2012»
13 years 6 months ago
Point-Based Manifold Harmonics
—This paper proposes an algorithm to build a set of orthogonal Point-Based Manifold Harmonic Bases (PB-MHB) for spectral analysis over point-sampled manifold surfaces. To ensure ...
Yang Liu, Balakrishnan Prabhakaran, Xiaohu Guo
116
Voted
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
15 years 8 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
130
Voted
VISUALIZATION
1999
IEEE
15 years 7 months ago
Rendering on a Budget: A Framework for Time-Critical Rendering
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
James T. Klosowski, Cláudio T. Silva
156
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
162
Voted
TVCG
2011
136views more  TVCG 2011»
14 years 10 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai