Sciweavers

257 search results - page 46 / 52
» The convexity spectra of graphs
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
DCG
2010
171views more  DCG 2010»
13 years 7 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
CAGD
2006
72views more  CAGD 2006»
13 years 7 months ago
Discrete one-forms on meshes and applications to 3D mesh parameterization
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
Steven J. Gortler, Craig Gotsman, Dylan Thurston
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
13 years 7 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey