256 search results - page 12 / 52 » Short trees in polygons |
ISBI
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, we use marked point processes to perform an unsupervised extraction of the coronary tree from 2D X-ray angiography. These processes provide a rigorous framework bas...
CGI
1998
IEEE
14 years 27 days ago
1998
IEEE
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
VRST
2003
ACM
14 years 1 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
SI3D
1995
ACM
14 years 4 days ago
1995
ACM
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...