TY - GEN
T1 - Approximating polygons and subdivisions with minimum link paths
AU - Guibas, Leonidas J.
AU - Hershberger, John E.
AU - Mitchell, Joseph S.B.
AU - Snoeyink, Jack Scott
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.
PY - 1991
Y1 - 1991
N2 - We study severed variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We also discuss additional topological constraints such as simplicity.
AB - We study severed variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We also discuss additional topological constraints such as simplicity.
UR - https://www.scopus.com/pages/publications/85027608700
U2 - 10.1007/3-540-54945-5_59
DO - 10.1007/3-540-54945-5_59
M3 - Conference contribution
AN - SCOPUS:85027608700
SN - 9783540549451
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 151
EP - 162
BT - ISA 1991 Algorithms - 2nd International Symposium on Algorithms, Proceedings
A2 - Lee, R.C.T.
A2 - Hsu, Wen-Lian
PB - Springer Verlag
T2 - 2nd Annual International Symposium on Algorithms, ISA 1991
Y2 - 16 December 1991 through 18 December 1991
ER -