Simplification of Polygonal Chains by Enforcing Few Distinctive Edge Directions

2017 ◽  
pp. 3-14 ◽  
Author(s):  
Melanie Pohl ◽  
Jochen Meidow ◽  
Dimitri Bulatov
Keyword(s):  
Polygonal Chains

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

2008 ◽  
pp. 630-641 ◽  
Author(s):  
Sergey Bereg ◽  
Minghui Jiang ◽  
Wencheng Wang ◽  
Boting Yang ◽  
Binhai Zhu
Keyword(s):  
Fréchet Distance ◽  
Frechet Distance ◽  
Polygonal Chains

Use of simple polygonal chains in generating random simple polygons

2017 ◽  
Vol 34 (2) ◽  
pp. 407-428
Author(s):  
Ali Nourollah ◽  
Mohsen Movahedinejad
Keyword(s):  
Simple Polygons ◽  
Polygonal Chains

Enumeration of Wiener indices in random polygonal chains

2019 ◽  
Vol 469 (2) ◽  
pp. 537-548
Author(s):  
Shouliu Wei ◽  
Wai Chee Shiu
Keyword(s):  
Polygonal Chains

scholarly journals Constrained Hopping Traversability Analysis on Non-Uniform Polygonal Chains

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 36691-36701
Author(s):  
Saurabh Upadhyay ◽  
A. Pedro Aguiar
Keyword(s):  
Polygonal Chains

APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS

1993 ◽  
Vol 03 (04) ◽  
pp. 383-415 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JOHN E. HERSHBERGER ◽  
JOSEPH S.B. MITCHELL ◽  
JACK SCOTT SNOEYINK
Keyword(s):  
Greedy Algorithms ◽  
Np Hard ◽  
Basic Approach ◽  
Line Segments ◽  
Minimum Number ◽  
Polygonal Chains ◽  
The Given ◽  
Plane Polygon

We study several 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 give some variants that have linear or O(n log n) algorithms approximating polygonal chains of n segments. We also show that approximating subdivisions and approximating with chains with. no self-intersections are NP-hard.

scholarly journals Reconfiguring closed polygonal chains in Euclideand-space

1995 ◽  
Vol 13 (1) ◽  
pp. 123-140 ◽  
Author(s):  
W. J. Lenhart ◽  
S. H. Whitesides
Keyword(s):  
Polygonal Chains

scholarly journals Locked and Unlocked Polygonal Chains in Three Dimensions

2001 ◽  
Vol 26 (3) ◽  
pp. 269-281 ◽  
Author(s):  
T. Biedl ◽  
E. Demaine ◽  
M. Demaine ◽  
S. Lazard ◽  
A. Lubiw ◽  
...  
Keyword(s):  
Three Dimensions ◽  
Polygonal Chains

Extremal problem with respect to Merrifield-Simmons index and Hosoya index of a class of polygonal chains

2014 ◽  
Vol 19 (4) ◽  
pp. 295-300 ◽  
Author(s):  
Wenwen Tian ◽  
Shuangliang Tian ◽  
Xue He ◽  
Yanfeng Wang
Keyword(s):  
Extremal Problem ◽  
Hosoya Index ◽  
Polygonal Chains

Delayed motor production of open polygonal chains presented visually in static and dynamic modes: Comparison between 9- to 11-year-old children and adults

2015 ◽  
Vol 41 (2) ◽  
pp. 143-149
Author(s):  
A. A. Antonova ◽  
K. A. Absatova ◽  
A. A. Korneev ◽  
A. V. Kurgansky
Keyword(s):  
Polygonal Chains ◽  
Motor Production

scholarly journals Polygonal chains with minimal energy

2003 ◽  
Vol 372 ◽  
pp. 333-344 ◽  
Author(s):  
Juan Rada ◽  
Antonio Tineo
Keyword(s):  
Minimal Energy ◽  
Polygonal Chains
Sign in / Sign up

Export Citation Format

Share Document