Sciweavers

2601 search results - page 55 / 521
» A Point in Many Triangles
Sort
View
CGF
2006
177views more  CGF 2006»
13 years 10 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...
CGF
2004
127views more  CGF 2004»
13 years 10 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
COMGEO
2010
ACM
13 years 10 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...
CHI
1999
ACM
14 years 2 months ago
Manual and Gaze Input Cascaded (MAGIC) Pointing
This work explores a new direction in utilizing eye gaze for computer input. Gaze tracking has long been considered as an alternative or potentially superior pointing method for c...
Shumin Zhai, Carlos Morimoto, Steven Ihde
ISPASS
2007
IEEE
14 years 4 months ago
Cross Binary Simulation Points
Architectures are usually compared by running the same workload on each architecture and comparing performance. When a single compiled binary of a program is executed on many diff...
Erez Perelman, Jeremy Lau, Harish Patil, Aamer Jal...