165 search results - page 7 / 33 » Computing hereditary convex structures |
SAC
2010
ACM
13 years 2 months ago
2010
ACM
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
ICCSA
2004
Springer
14 years 27 days ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...