Sciweavers

4131 search results - page 227 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
COMPGEOM
2004
ACM
15 years 9 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
JVCA
2006
140views more  JVCA 2006»
15 years 3 months ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni
CVPR
2009
IEEE
16 years 11 months ago
Visibility Constraints on Features of 3D Objects
To recognize three-dimensional objects it is important to model how their appearances can change due to changes in viewpoint. A key aspect of this involves understanding which o...
Ronen Basri, Pedro F. Felzenszwalb, Ross B. Girshi...
NETWORKS
2002
15 years 3 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
TEC
2002
152views more  TEC 2002»
15 years 3 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck