2009•Computer and ModernizationRequires access

An Improved Algorithm for Polygon Clipping in Complex Polygon Window

Hou Bao-ming

Abstract

Polygon clipping is a very hot research issue in computer graphics.An efficient and reliable algorithm for complex polygon clipping in a complex polygon window is proposed.Virtual edges are added to eliminate holes,and traversal method is improved to restore the original appearance of the clipping results.In the new traversal algorithm,after the two polygons are traversed only one time,it is very clever to get all the clipping results and restore the topology between the outside border and the holes of the every clipping result with holes.Neither untie and unite ring,nor recombination of clipping borders is used.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Clipping (morphology), Computer science, Tree traversal, Polygon (computer graphics), Algorithm, Window (computing), Computer graphics, Computer graphics (images)