Sciweavers

13 search results - page 1 / 3
» Independent Set of Intersection Graphs of Convex Objects in ...
Sort
View
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
13 years 10 months ago
Independent Set of Intersection Graphs of Convex Objects in 2D
Pankaj K. Agarwal, Nabil H. Mustafa
ADCM
2007
100views more  ADCM 2007»
13 years 5 months ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn
WG
2004
Springer
13 years 10 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
13 years 10 months ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec
ICPR
2008
IEEE
14 years 6 months ago
Force histograms computed in O(NlogN)
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
JingBo Ni, Pascal Matsakis