Sciweavers

36 search results - page 4 / 8
» Grammar Factorization by Tree Decomposition
Sort
View
COMGEO
2002
ACM
14 years 9 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
Siu-Wing Cheng, Kam-Hing Lee
LATIN
2004
Springer
15 years 3 months ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse
ESOP
2009
Springer
15 years 1 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
COMGEO
2006
ACM
14 years 9 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse
TSP
2008
119views more  TSP 2008»
14 years 9 months ago
The Shiftable Complex Directional Pyramid - Part II: Implementation and Applications
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
Truong T. Nguyen, Soontorn Oraintara