2002•Machine Design and Manufacturing EngineeringRequires access

Rapid Algorithm on the Edge Clipping of General Polygons

Yanbin Fan

Abstract

Clipping algorithms were one of the most fundamental ways in computer graphics. Most algorithms were used to deal with rectangular windows and convex polygons. Concave polygons had to be divided into several convex polygons. It described a clipping algorithm for general polygons, this could be used for 2D removing hidden edges of parts assembly drawing.

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), Regular polygon, Point in polygon, Computer graphics, Enhanced Data Rates for GSM Evolution, Algorithm, Computer science, Computer graphics (images)