Paper Title:
Overlay Algorithm for Simple Subdivision of Arbitrary Polygon in Plane
  Abstract

The overlay algorithm is an important branch in computational geometry field, it is an important process for computing exact Minkowski sum of two convex polyhedrons. By improving the existing plane sweep algorithm, the overlay algorithm for simple subdivision of arbitrary polygon in plane is given. The algorithm can be used to overlay arbitrary polygon after subdivision into simple polygon in the plane. It has lower time complexity than the existing overlay algorithm. The whole algorithm consists of three steps: line segment intersection, reconstructing topology and constructing the DCEL for overlay graph. The results show that the algorithm can compute the overlay of two planar subdivisions in linear time.

  Info
Periodical
Advanced Materials Research (Volumes 219-220)
Edited by
Helen Zhang, Gang Shen and David Jin
Pages
223-227
DOI
10.4028/www.scientific.net/AMR.219-220.223
Citation
X. J. Guo, L. Chang, Y. L. Gao, "Overlay Algorithm for Simple Subdivision of Arbitrary Polygon in Plane", Advanced Materials Research, Vols. 219-220, pp. 223-227, 2011
Online since
March 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zhi Qiang Xie, Jing Yang, Yu Jing He, Guang Jie Ye
Abstract:Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an...
897
Authors: Ying Lin Li, Man Liang Qiu, Lian He Yang
Abstract:In view of the defect and shortage in cutting path automatic optimization of 2D pattern pieces in current garment automatic cutter, a new...
973
Authors: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen
Chapter 16: Geographic Information and Remote Sensing Science
Abstract:FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of...
2880
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Xue Feng Wu, Yu Fan
Chapter 6: Mechatronics
Abstract:A new algorithms for parameters of an image irregular boundary circle parameters is presented, which is based on “Curve-Approximate Method”...
639