676 search results - page 89 / 136 » A Search-Free Intersection Algorithm |
103
click to vote
COMPGEOM
1997
ACM
15 years 4 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
88
Voted
VRST
1997
ACM
15 years 4 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
87
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
78
Voted
ASPDAC
2008
ACM
15 years 2 months ago
2008
ACM
- In multi-layered power/ground (P/G) networks, to connect the whole network together, vertical vias are usually placed at intersections between metal wires of adjoining layers. In...
102
click to vote
UAI
2003
15 years 1 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...