150 search results - page 17 / 30 » Traversing a set of points with a minimum number of turns |
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
DAC
1989
ACM
13 years 11 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
DASFAA
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract. Besides topological relations and approximate relations, cardinal directions have turned out to be an important class of qualitative spatial relations. In spatial databas...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...