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

An Efficient Algorithm to Determine the Intersection of Simple Polygons for Robot Path Planning

1996 ◽  
Author(s):  
S. Miao ◽  
D. Howard
Keyword(s):  
Path Planning ◽  
Efficient Algorithm ◽  
Robot Path Planning ◽  
Simple Polygons ◽  
Clockwise Direction ◽  
Robot Path

Abstract This paper presents an efficient algorithm for determining the intersection of two simple polygons. The proposed algorithm is based on the idea of searching for the vertices of the intersection polygon vertex by vertex along the boundary in a clockwise direction. This method finds the intersection polygon vertices and their order in one pass. The algorithm almost eliminates the need for testing whether candidate vertices are inside both polygons and the sorting stage is no longer needed.

Morphing Simple Polygons

2000 ◽  
Vol 24 (1) ◽  
pp. 1-34 ◽  
Author(s):  
L. Guibas ◽  
J. Hershberger ◽  
S. Suri
Keyword(s):  
Simple Polygons

scholarly journals Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

2017 ◽  
Vol 27 (01n02) ◽  
pp. 121-158 ◽  
Author(s):  
Martin Nöllenburg ◽  
Roman Prutkin ◽  
Ignaz Rutter
Keyword(s):  
Routing Protocol ◽  
Graph Drawing ◽  
Geographic Routing ◽  
Np Hard ◽  
Line Drawings ◽  
Simple Polygons ◽  
Straight Line ◽  
Starting Point ◽  
Minimum Decomposition ◽  
Geographic Routing Protocol

A greedily routable region (GRR) is a closed subset of [Formula: see text], in which any destination point can be reached from any starting point by always moving in the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygonal regions with holes. We consider minimum GRR decomposition for plane straight-line drawings of graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing style which has become a popular research topic in graph drawing. We show that minimum decomposition is still NP-hard for graphs with cycles and even for trees, but can be solved optimally for trees in polynomial time, if we allow only certain types of GRR contacts. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.

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

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
Sign in / Sign up

Export Citation Format

Share Document