Sciweavers

256 search results - page 30 / 52
» Short trees in polygons
Sort
View
ICCS
2004
Springer
14 years 2 months ago
Point-Based Modeling from a Single Image
Abstract. The complexity of virtual environments has grown spectacularly over the recent years, mainly thanks to the use of the currently cheap high performance graphics cards. As ...
Pere-Pau Vázquez, Jordi Marco, Mateu Sbert
RT
2000
Springer
14 years 6 days ago
Hierarchical Instantiation for Radiosity
We present the concept of hierarchical instantiation for radiosity. This new method enables an efficient, yet accurate determination of the illumination in very large scenes, wher...
Cyril Soler, François X. Sillion
IJRR
2008
115views more  IJRR 2008»
13 years 8 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
POPL
2010
ACM
14 years 6 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
VLDB
2005
ACM
397views Database» more  VLDB 2005»
14 years 8 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...