Sciweavers

5 search results - page 1 / 1
» Finding equitable convex partitions of points in a polygon e...
Sort
View
TALG
2010
107views more  TALG 2010»
13 years 10 days ago
Finding equitable convex partitions of points in a polygon efficiently
John Gunnar Carlsson, Benjamin Armbruster, Yinyu Y...
CCCG
2006
13 years 7 months ago
Rotationally Monotone Polygons
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Ste...
DCOSS
2007
Springer
13 years 9 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 7 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
TKDE
2002
168views more  TKDE 2002»
13 years 5 months ago
CLARANS: A Method for Clustering Objects for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
Raymond T. Ng, Jiawei Han