Results 241 to 250 of about 2,886,103 (258)

Slim Near Polygons

Designs, Codes and Cryptography, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B. Bruyn
semanticscholar   +3 more sources

A Higman inequality for regular near polygons

Journal of Algebraic Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Vanhove
semanticscholar   +3 more sources

Near Polygons from Partial Linear Spaces

Geometriae Dedicata, 1999
Starting from a partial linear space \({\mathcal S} =(P, {\mathcal L})\) the authors discuss four constructions which alter the structure of \({\mathcal S}\), thus obtaining infinitely many non-degenerate as well as degenerate near polygons. An incidence structure is called a partial linear space, if every line is incident with at least two points and ...
B. Bruyn, F. Clerck
semanticscholar   +2 more sources

On near-polygons and the coxeter cap in PG(5,3)

Journal of Geometry, 2000
Let \(PG(n,q)\) be the \(n\)-dimensional projective space over the Galois field \(GF(q)\). In the paper under review an upper bound for the cardinality of a set of points in \(PG(n,q)\) with the property that no \(t\) of them are contained in a \((t-2)\)-flat \((n\geq r-2\geq 0)\) is found, and the case of equality is investigated.
B. Bruyn
semanticscholar   +3 more sources

Dense near polygons

, 2006
B. Bruyn
semanticscholar   +2 more sources

Regular near polygons

, 2006
B. Bruyn
semanticscholar   +2 more sources

Near-optimal adaptive polygonization

Proceedings Computer Graphics International CGI-99, 1999
Consider a triangulation of the xy plane, and a general surface z=f(x, y). The points of the triangle, when lifted to the surface, form a linear spline approximation to the surface. We are interested in the error between the surface and the linear approximant.
Wolfgang Seibold, Kenneth I. Joy
openaire   +1 more source

Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment

Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 2002
We consider the problem of planning the motion of an arbitrary k-sided polygonal robot B, free to translate and rotate in a polygonal environment V bounded by n edges. We show that the combinatorial complexity of a single connected component of the free configuration space of B is k/sup 3/n/sup 2/2/sup O(log(2/3)/ n).
Dan Halperin, Micha Sharir
openaire   +1 more source

A Family of Near-Polygonal Graphs of Valency 10

Annals of Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seress, Ákos, Swartz, Eric
openaire   +2 more sources

Deformable Polygon Representation and Near-Mincuts

2008
We derive a necessary and sufficient condition for a symmetric family of sets to have a geometric representation involving a convex polygon and some of its diagonals. We show that cuts of value less than 6/5 times the edge-connectivity of a graph admit such a representation, thereby extending the cactus representation of all mincuts.
András A. Benczúr, Michel X. Goemans
openaire   +1 more source