CCCG 2007 - PDF Preprint Papers

CCCG 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCCG-2007 Paper

click to vote

CCCG
2007

172views Computational Geometry» more CCCG 2007»

Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull

13 years 6 months ago

Download cccg.ca

We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...

Peyman Afshani, Arash Farzan

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	172	Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull	claim
2	146	Approximate Shortest Descent Path on a Terrain	claim
3	146	Approximating k-hop Minimum Spanning Trees in Euclidean Metrics	claim
4	138	Approximations of Geodesic Distances for Incomplete Triangular Manifolds	claim
5	136	Contraction and Expansion of Convex Sets	claim
6	131	Computing Acute and Non-obtuse Triangulations	claim
7	130	Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs	claim
8	124	Morphing Planar Graph Drawings	claim
9	123	On Bus Graph Realizability	claim
10	118	Homothetic Triangle Contact Representations of Planar Graphs	claim
11	118	Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm	claim
12	115	Pointed Drawings of Planar Graphs	claim
13	114	Terminal Steiner Tree with Bounded Edge Length	claim
14	111	Optimal Point Set Partitioning using Rigid Motion Star Placement	claim
15	111	A Lower Bound on the Area of a 3-Coloured Disc Packing	claim
16	108	Approximation Algorithms for the Minimum-Length Corridor and Related Problems	claim
17	107	Covering Points by Isothetic Unit Squares	claim
18	105	Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations	claim
19	105	Capturing Crossings: Convex Hulls of Segment and Plane Intersections	claim
20	104	Note on the Pair-Crossing Number and the Odd-Crossing Number	claim
21	104	Generalized Watchman Route Problem with Discrete View Cost	claim
22	104	Unfolding Polyhedra via Cut-Tree Truncation	claim
23	103	On the Fewest Nets Problem for Convex Polyhedra	claim
24	103	On the Number of Empty Pseudo-Triangles in Point Sets	claim
25	96	Hamilton Circuits in Hexagonal Grid Graphs	claim
26	95	Optimal Schedules for 2-guard Room Search	claim
27	94	The Ordinary Line Problem Revisited	claim
28	94	Optimistic and Pessimistic Shortest Paths on Uncertain Terrains	claim
29	92	Triangulations Loosing Bundles and Weight	claim
30	91	Open Problems from CCCG 2006	claim
31	90	Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area	claim
32	89	Improved Layouts of the Multigrid Network	claim
33	87	On Unfolding Trees and Polygons on Various Lattices	claim
34	85	Spiralling and Folding: The Topological View	claim
35	82	Terrain Representation using Right-Triangulated Irregular Networks	claim
36	80	A Disk-Covering Problem with Application in Optical Interferometry	claim
37	80	Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment	claim
38	78	Vertex Pops and Popturns	claim
39	75	On Rolling Cube Puzzles	claim
40	75	A Note on Drawing Direction-constrained Paths in 3D	claim
41	73	On a Geometric Approach to the Segment Sum Problem and Its Generalization	claim
42	73	Largest Subsets of Triangles in a Triangulation	claim
43	68	Restricted Edge Contractions in Triangulations of the Sphere with Boundary	claim
44	67	The Slider-Pinning Problem	claim
45	58	Linear-Space Algorithms for Distance Preserving Embedding	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers