Results 1  10
of
636,173
Geometric structures for threedimensional shape representation
 ACM Trans. Graph
, 1984
"... Different geometric structures are investigated in the context of discrete surface representation. It is shown that minimal representations (i.e., polyhedra) can be provided by a surfacebased method using nearest neighbors structures or by a volumebased method using the Delaunay triangulation. Bot ..."
Abstract

Cited by 195 (5 self)
 Add to MetaCart
Different geometric structures are investigated in the context of discrete surface representation. It is shown that minimal representations (i.e., polyhedra) can be provided by a surfacebased method using nearest neighbors structures or by a volumebased method using the Delaunay triangulation
their geometric structure
"... y (Communicated by H. Van Maldeghem) Abstract. In a previous paper R. Mathon gave a new construction method for maximal arcs in finite Desarguesian projective planes via closed sets of conics, as well as giving many new examples of maximal arcs. In the current paper, new classes of maximal arcs are ..."
Abstract
 Add to MetaCart
of when a closed set of conics is of Denniston type is given. Results on the geometric structure of the maximal arcs and their duals are proved, as well as on elements of their collineation stabilisers. 1
Dictionary of protein secondary structure: pattern recognition of hydrogenbonded and geometrical features
 Biopolymers
, 1983
"... structure ..."
Voronoi diagrams  a survey of a fundamental geometric data structure
 ACM COMPUTING SURVEYS
, 1991
"... This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. ..."
Abstract

Cited by 753 (5 self)
 Add to MetaCart
This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development
Geometric Structures And Varieties Of Representations
 Proceedings of Amer. Math. Soc. Summer Conference
, 1988
"... . Many interesting geometric structures on manifolds can be interpreted as structures locally modelled on homogeneous spaces. Given a homogeneous space (X, G) and a manifold M , there is a deformation space of structures on M locally modelled on the geometry of X invariant under G. Such a geomet ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
. Many interesting geometric structures on manifolds can be interpreted as structures locally modelled on homogeneous spaces. Given a homogeneous space (X, G) and a manifold M , there is a deformation space of structures on M locally modelled on the geometry of X invariant under G. Such a
DavenportSchinzel Sequences and Their Geometric Applications
, 1998
"... An (n; s) DavenportSchinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly noncontiguous) subsequence, any alternation a \Delta \Delta \Delta b \Delta \ ..."
Abstract

Cited by 471 (115 self)
 Add to MetaCart
of geometric problems can be formulated in terms of lower envelopes. A nearlinear bound on the maximum length of DavenportSchinzel sequences enable us to derive sharp bounds on the combinatorial structure underlying various geometric problems, which in turn yields efficient algorithms for these problems.
ON LOVELY PAIRS OF GEOMETRIC STRUCTURES
, 2008
"... We study the theory of lovely pairs of geometric structures, in particular ominimal structures. We characterize "linear" theories in terms of properties of the corresponding theory of the lovely pair. For ominimal theories, we use PeterzilStarchenko's trichotomy theorem to characte ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We study the theory of lovely pairs of geometric structures, in particular ominimal structures. We characterize "linear" theories in terms of properties of the corresponding theory of the lovely pair. For ominimal theories, we use PeterzilStarchenko's trichotomy theorem
Geometrical structure of Laplacian eigenfunctions
, 2013
"... We summarize the properties of eigenvalues and eigenfunctions of the Laplace operator in bounded Euclidean domains with Dirichlet, Neumann, or Robin boundary condition. We keep the presentation at a level accessible to scientists from various disciplines ranging from mathematics to physics and com ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
and computer sciences. The main focus is placed onto multiple intricate relations between the shape of a domain and the geometrical structure of eigenfunctions.
Results 1  10
of
636,173