COMPGEOM 2008 - PDF Preprint Papers

COMPGEOM 2008 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2008 Paper

click to vote

COMPGEOM
2008
ACM

155views Discrete Geometry» more COMPGEOM 2008»

Circular partitions with applications to visualization and embeddings

13 years 7 months ago

Download people.csail.mit.edu

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	155	Circular partitions with applications to visualization and embeddings	claim
2	142	Discrete laplace operator on meshed surfaces	claim
3	132	Robust construction of the three-dimensional flow complex	claim
4	131	Delpsc: a delaunay mesher for piecewise smooth complexes	claim
5	128	Exact geometric-topological analysis of algebraic surfaces	claim
6	124	Towards persistence-based reconstruction in euclidean spaces	claim
7	122	External memory planar point location with logarithmic updates	claim
8	118	Reeb spaces of piecewise linear mappings	claim
9	117	Consistent digital rays	claim
10	115	Arrangements of geodesic arcs on the sphere	claim
11	114	Analyzing rigidity with pebble games	claim
12	114	Visualizing and exploring planar algebraic arrangements: a web application	claim
13	114	Embedding and similarity search for point sets under translation	claim
14	111	Maximum thick paths in static and dynamic environments	claim
15	110	Extremal problems on triangle areas in two and three dimensions	claim
16	109	Tighter bounds for random projections of manifolds	claim
17	106	The complexity of the outer face in arrangements of random segments	claim
18	101	Testing contractibility in planar rips complexes	claim
19	101	Intersecting convex sets by rays	claim
20	100	Schnyder woods for higher genus triangulated surfaces	claim
21	98	A simple and efficient kinetic spanner	claim
22	97	Markov incremental constructions	claim
23	97	Minkowski sums of rotating convex polyhedra	claim
24	97	Predicates for line transversals to lines and line segments in three-dimensional space	claim
25	97	Self-improving algorithms for delaunay triangulations	claim
26	96	Walking your dog in the woods in polynomial time	claim
27	93	Optimizing active ranges for consistent dynamic map labeling	claim
28	93	Routing a maximum number of disks through a scene of moving obstacles	claim
29	92	Locally uniform anisotropic meshing	claim
30	87	Markov convexity and local rigidity of distorted metrics	claim
31	86	Helly-type theorems for approximate covering	claim
32	83	Hinged dissections exist	claim
33	79	Untangling triangulations through local explorations	claim
34	76	Improved upper bounds on the crossing number	claim
35	73	Polychromatic colorings of plane graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers