Sciweavers

1009 search results - page 175 / 202
» On Indexing Line Segments
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 10 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
GIS
2008
ACM
13 years 10 months ago
Towards a geometric interpretation of double-cross matrix-based similarity of polylines
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
Bart Kuijpers, Bart Moelans
COMGEO
2008
ACM
13 years 9 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...
IEPOL
2006
67views more  IEPOL 2006»
13 years 8 months ago
Platform competition and broadband uptake: Theory and empirical evidence from the European union
Broadband access provides users with high speed, always-on connectivity to the Internet. Due to its superiority, broadband is seen as the way for consumers and firms to exploit th...
Walter Distaso, Paolo Lupi, Fabio M. Manenti
KAIS
2006
87views more  KAIS 2006»
13 years 8 months ago
Improving the performance of 1D object classification by using the Electoral College
Abstract It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matchi...
Liang Chen, Ruoyu Chen, Sharmin Nilufar