Results 231 to 240 of about 13,845 (257)

Living Wild in a Mediterranean Island: Spatial and Temporal Behaviour of Free-Roaming Cats in Cyprus. [PDF]

Animals (Basel)
Zacharia M, Vogiatzakis IN, Zotos S.
europepmc   +1 more source

Linking the Weibull distribution to Gini coefficients: a bamboo specific framework for intra-culm leaf area inequality. [PDF]

Front Plant Sci
Jiao Z, Liu S, Niklas KJ, Damgaard CF, Yao W, Lian M, Jiang F, Shi P.   +7 more
europepmc   +1 more source

Digital tools for analyzing nondiffeomorphic shapes. [PDF]

Proc Natl Acad Sci U S A
Kirveslahti H, Wang X.
europepmc   +1 more source

Constructions and characterizations of near polygons

, 1999
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Note on Regular Near Polygons

Graphs and Combinatorics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jack Koolen, Hiraki Akira
exaly   +4 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

Slim Near Polygons

Designs, Codes and Cryptography, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Decomposable Near Polygons

Annals of Combinatorics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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

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 ...
De Bruyn, Bart, De Clerck, Frank
openaire   +1 more source