Results 161 to 170 of about 2,125,495 (197)

Digital disaggregation of soil subgroups using DSMART in a Mediterranean semiarid landscape. [PDF]

Sci Rep
Turgut YS, Koca YK, Dengiz O.
europepmc   +1 more source

A High-Precision Cooperative Localization Method for UAVs Based on Multi-Condition Constraints. [PDF]

Sensors (Basel)
Liu H, Jiang W, Long Q, Xia Q, Chen X.
europepmc   +1 more source

Constructions and characterizations of near polygons

, 1999
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   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Deformable Polygon Representation and Near-Mincuts

Bolyai Society Mathematical Studies, 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
exaly   +2 more sources

A Note on Regular Near Polygons

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

Slim Near Polygons

Designs, Codes and Cryptography, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 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   +2 more sources