192 search results - page 12 / 39 » Cut Points in PEG |
RT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a new data structure for encoding the appearance of a geometric model as seen from a viewing region (view cell). This representation can be used in interactive...
64
Voted
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Autonomous collision avoidance in vehicles requires an accurate seperation of obstacles from the background, particularly near the focus of expansion. In this paper, we p...
PG
2003
IEEE
15 years 2 months ago
2003
IEEE
We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the cu...
ESA
2000
Springer
15 years 1 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...