CCCG 2008 - PDF Preprint Papers

CCCG 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCCG-2008 Paper

click to vote

CCCG
2008

186views Computational Geometry» more CCCG 2008»

Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis

14 years 1 months ago

Download cccg.ca

We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...

Jérémy Barbay, Eric Y. Chen

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	186	Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis	claim
2	151	Computational Balloon Twisting: The Theory of Balloon Polyhedra	claim
3	150	A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model	claim
4	142	Data Structures for Range-Aggregate Extent Queries	claim
5	138	The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees	claim
6	134	Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors	claim
7	131	Core-Preserving Algorithms	claim
8	129	Maximal Covering by Two Isothetic Unit Squares	claim
9	128	Competitive Search for Longest Empty Intervals	claim
10	124	Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics	claim
11	122	The Solution Path of the Slab Support Vector Machine	claim
12	121	On the Complexity of Point Recolouring in Geometric Graphs	claim
13	118	A Class of Convex Polyhedra with Few Edge Unfoldings	claim
14	116	Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time	claim
15	116	Empty Monochromatic Triangles	claim
16	116	Smallest enclosing circle centered on a query line segment	claim
17	115	Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object	claim
18	113	Application of computational geometry to network p-center location problems	claim
19	111	Guaranteed Voronoi Diagrams of Uncertain Sites	claim
20	109	Data Structures for Restricted Triangular Range Searching	claim
21	108	Searching for Frequent Colors in Rectangles	claim
22	108	Polynomial irreducibility testing through Minkowski summand computation	claim
23	107	Partial Matching of Planar Polygons Under Translation and Rotation	claim
24	106	Linear-Size Meshes	claim
25	104	A generalization of Apollonian packing of circles	claim
26	101	Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap	claim
27	98	On a Cone Covering Problem	claim
28	96	Monochromatic simplices of any volume	claim
29	96	Isometric Morphing of Triangular Meshes	claim
30	95	An Efficient Query Structure for Mesh Refinement	claim
31	94	Minimum blocking sets of circles for a set of lines in the plane	claim
32	92	Direct Planar Tree Transformation and Counterexample	claim
33	90	The Embroidery Problem	claim
34	90	A Pumping Lemma for Homometric Rhythms	claim
35	89	Memory Requirements for Local Geometric Routing and Traversal in Digraphs	claim
36	88	Draining a Polygon - or - Rolling a Ball out of a Polygon	claim
37	88	On distinct distances among points in general position and other related problems	claim
38	85	Polar Diagram of Moving Objects	claim
39	85	Recognition of Largest Empty Orthoconvex Polygon in a Point Set	claim
40	84	Partitioning a Polygon into Two Mirror Congruent Pieces	claim
41	83	Polygonal Chain Simplification with Small Angle Constraints	claim
42	76	Triangulating and Guarding Realistic Polygons	claim
43	74	VC-Dimension of Visibility on Terrains	claim
44	73	Polygons Folding to Plural Incongruent Orthogonal Boxes	claim
45	72	Adaptive Searching in One and Two Dimensions	claim
46	66	Generalized Ham-Sandwich Cuts for Well Separated Point Sets	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers