Sciweavers

13 search results - page 2 / 3
» Two Linear-Time Algorithms for Computing the Minimum Length ...
Sort
View
COR
2006
94views more  COR 2006»
13 years 4 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
COCOON
2006
Springer
13 years 8 months ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang
AGIS
2008
319views more  AGIS 2008»
13 years 5 months ago
An Efficient Algorithm for Raster-to-Vector Data Conversion
Data conversion from raster to vector (R2V) is a key function in Geographic Information Systems (GIS) and remote sensing (RS) image processing for integrating GIS and RS data. The...
Junhua Teng, Fahui Wang, Yu Liu
ICPR
2000
IEEE
14 years 6 months ago
Piecewise Linear Skeletonization Using Principal Curves
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
Adam Krzyzak, Balázs Kégl
JEA
2006
90views more  JEA 2006»
13 years 4 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...