Sciweavers

18306 search results - page 126 / 3662
» Algorithmics in Exponential Time
Sort
View
ISVC
2009
Springer
15 years 2 months ago
Layered Volume Splatting
We present a new layered, hardware-accelerated splatting algorithm for volume rendering. Layered volume splatting features the speed benefits of fast axis-aligned pre-classified ...
Philipp Schlegel, Renato Pajarola
FUIN
2008
98views more  FUIN 2008»
14 years 10 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
IJCGA
2010
155views more  IJCGA 2010»
14 years 8 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
FOCS
1997
IEEE
15 years 2 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler