[ספר][B] Triangulations: structures for algorithms and applications
J De Loera, J Rambau, F Santos - 2010 - books.google.com
Triangulations presents the first comprehensive treatment of the theory of secondary
polytopes and related topics. The text discusses the geometric structure behind the …
polytopes and related topics. The text discusses the geometric structure behind the …
[PDF][PDF] Geometric range searching and its relatives
About ten years ago, the eld of range searching, especially simplex range searching, was
wide open. At that time, neither e cient algorithms nor nontrivial lower bounds were known …
wide open. At that time, neither e cient algorithms nor nontrivial lower bounds were known …
Simplex range searching and its variants: A review
A central problem in computational geometry, range searching arises in many applications,
and numerous geometric problems can be formulated in terms of range searching. A typical …
and numerous geometric problems can be formulated in terms of range searching. A typical …
[ספר][B] Geometric graphs and arrangements: some chapters from combinatorial geometry
S Felsner - 2012 - books.google.com
Among the intuitively appealing aspects of graph theory is its close connection to drawings
and geometry. The development of computer technology has become a source of motivation …
and geometry. The development of computer technology has become a source of motivation …
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with
pointed vertices (incident to an angle larger than p). In this paper we prove that the opposite …
pointed vertices (incident to an angle larger than p). In this paper we prove that the opposite …
Expansive motions and the polytope of pointed pseudo-triangulations
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane,
defined as the polytope of infinitesimal expansive motions of the points subject to certain …
defined as the polytope of infinitesimal expansive motions of the points subject to certain …
Pseudo-triangulations-a survey
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-
triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo …
triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo …
Multitriangulations, pseudotriangulations and primitive sorting networks
We study the set of all pseudoline arrangements with contact points which cover a given
support. We define a natural notion of flip between these arrangements and study the graph …
support. We define a natural notion of flip between these arrangements and study the graph …
Pseudoline Arrangements.
JE Goodman - 2004 - books.google.com
Pseudoline arrangements generalize in a natural way arrangements of straight lines,
discarding the straightness aspect, but preserving their basic topological and combinatorial …
discarding the straightness aspect, but preserving their basic topological and combinatorial …
[HTML][HTML] Visibility and ray shooting queries in polygonal domains
Given a polygonal domain (or polygon with holes) in the plane, we study the problem of
computing the visibility polygon of any query point. As a special case of visibility problems …
computing the visibility polygon of any query point. As a special case of visibility problems …