Sciweavers

2638 search results - page 57 / 528
» Random Geometric Complexes
Sort
View
118
Voted
VRML
1997
ACM
15 years 8 months ago
Lodestar: An Octree-Based Level of Detail Generator for VRML
Level of detail generation is important for managing geometric complexity of three-dimensional objects and virtual worlds. However, most algorithms that compute levels of detail do...
Dieter Schmalstieg
JGAA
2002
74views more  JGAA 2002»
15 years 3 months ago
Realization of Posets
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
Patrice Ossona de Mendez
117
Voted
SIAMMA
2011
71views more  SIAMMA 2011»
14 years 11 months ago
Reconstruction of Penetrable Obstacles in Acoustic Scattering
We develop a reconstruction algorithm to determine penetrable obstacles inside a domain in the plane from acoustic measurements made on the boundary. This algorithm uses complex g...
Sei Nagayasu, Gunther Uhlmann, Jenn-Nan Wang
141
Voted
HAPTICS
2007
IEEE
15 years 10 months ago
Incorporating Geometric Algorithms in Impedance- and Admittance-Type Haptic Rendering
Geometric (proxy-based) haptic rendering algorithms are widely used in impedance-type haptic rendering. Such methods are useful for developing complex virtual environment because ...
Ryo Kikuuwe, Hideo Fujimoto
CCCG
2004
15 years 5 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...