A simple en,ex marking rule for degenerate intersection points in 2D polygon clipping

09/01/2017
by   Romeo Traian Popa, et al.
0

A simple en,ex rule to mark the intersection points of 2D input polygon contours separating the polygon interior from its exterior in the vicinity of the intersections is presented. Its form is close to the original Greiner & Hormann algorithm rule but encompasses degenerate intersections that are not self-intersections. It only uses local geometric information once the hand of the two input contours is known. The approach foundation is the distinction between two features of the studied intersections: the geometric intersection point and the assembling/concatenation point of the result contour/border. No special form of the intersection finding procedure is required.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2019

Non-idempotent intersection types in logical form

Intersection types are an essential tool in the analysis of operational ...
research
01/21/2000

Bezier Curves Intersection Using Relief Perspective

Presented paper describes the method for finding the intersection of cla...
research
05/25/2020

Stratified Formal Deformations and Intersection Homology of Data Point Clouds

Intersection homology is a topological invariant which detects finer inf...
research
08/01/2023

A geometric approach to approximating the limit set of eigenvalues for banded Toeplitz matrices

This article is about finding the limit set for banded Toeplitz matrices...
research
11/25/2008

String Art: Circle Drawing Using Straight Lines

An algorithm to generate the locus of a circle using the intersection po...
research
04/10/2021

Random Intersection Chains

Interactions between several features sometimes play an important role i...
research
10/09/2020

Improving Local Identifiability in Probabilistic Box Embeddings

Geometric embeddings have recently received attention for their natural ...

Please sign up or login with your details

Forgot password? Click here to reset