Results 1 to 10 of about 13,845 (257)

An algorithm for polygon clipping, and for determining polygon intersections and unions

Computers and Geosciences, 2007
Borut Zalik
exaly  

Computing the geodesic center of a simple polygon

Discrete and Computational Geometry, 1989
Sharir M, M Sharir
exaly  

Decomposing a Polygon into Simpler Components

SIAM Journal on Computing, 1985
J Mark Keil
exaly  

Glued near polygons

2006
openaire   +1 more source

Regular near polygons

2006
openaire   +1 more source

Dense near polygons

2006
openaire   +1 more source

Hidden surface removal using polygon area sorting

Computer Graphics, 1977
exaly  

Near polygons having a big sub near polygon isomorphic to HD(2n-1, 4).

Ars Comb., 2006
Bart De Bruyn, Pieter Vandecasteele
openaire  

The known slim dense near polygons

2006
openaire   +1 more source

The Hyperplanes of the M 24 Near Polygon [PDF]

Graphs and Combinatorics, 2002
Consider the unique Steiner system \(S(5,8,24)\) on a set \(\Omega\) of 24 symbols. Let \(\Gamma = (P,L)\) be the partial linear space (with point set \(P\) and line set \(L\)) obtained by taking the 759 octads as points, and the triples of pairwise disjoint octads as lines. The space \(\Gamma\) is the (unique) regular near hexagon of order \((s,t,t_2)
Hans Cuypers, Andries E Brouwer, Brouwer Andries E   +2 more
exaly   +3 more sources