Sciweavers

591 search results - page 84 / 119
» Compatible Geometric Matchings
Sort
View
106
Voted
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 2 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
111
Voted
EUROGRAPHICS
2010
Eurographics
15 years 1 months ago
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
Ville Timonen and Jan Westerholm
71
Voted
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 24 days ago
Table manipulation in simplicial databases
In [Spi], we developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, our...
David I. Spivak
83
Voted
CGF
1999
91views more  CGF 1999»
15 years 11 days ago
Efficient and Handy Texture Mapping on 3D Surfaces
There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the pro...
Kenji Matsushita, Toyohisa Kaneko
ICRA
2009
IEEE
125views Robotics» more  ICRA 2009»
14 years 10 months ago
Photometry-based visual servoing using light reflexion models
Abstract-- We present in this paper a way to achieve positioning tasks by visual servoing under complex luminance variations. To do that, we use as visual features the luminance of...
Christophe Collewet, Éric Marchand