CCCG 2006 - PDF Preprint Papers

CCCG 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCCG-2006 Paper

click to vote

CCCG
2006

137views Computational Geometry» more CCCG 2006»

An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points

14 years 3 months ago

Download cccg.ca

In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...

Asish Mukhopadhyay, Robert L. Scot Drysdale

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	137	An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points	claim
2	136	On Computing Shortest External Watchman Routes for Convex Polygons	claim
3	133	Realization of Degree 10 Minimum Spanning Trees in 3-Space	claim
4	127	Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts	claim
5	127	Another Paradigm for Geometric Constraints Solving	claim
6	126	An Optimal Solution to Room Search Problem	claim
7	124	Curves in the Sand: Algorithmic Drawing	claim
8	118	Characterization of Polygons Searchable by a Boundary 1-Searcher	claim
9	118	A Study of Conway's Thrackle Conjecture	claim
10	118	Computing the Tool Path of an Externally Monotone Polygon in Linear Time	claim
11	116	Geometric Separator for d-Dimensional Ball Graphs	claim
12	116	A Simple Streaming Algorithm for Minimum Enclosing Balls	claim
13	114	On the Smallest Enclosing Information Disk	claim
14	113	Small Weak Epsilon-Nets in Three Dimensions	claim
15	113	Spanning trees across axis-parallel segments	claim
16	112	The Complexity of a Pop-Up Book	claim
17	108	(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram	claim
18	107	Removing Outliers to Minimize Area and Perimeter	claim
19	102	Local Overlaps In Special Unfoldings Of Convex Polyhedra	claim
20	100	2D Triangulation Representation Using Stable Catalogs	claim
21	98	Routing with Guaranteed Delivery on Virtual Coordinates	claim
22	97	Bounded-Curvature Path Normalization	claim
23	97	An Improved Approximation Factor For The Unit Disk Covering Problem	claim
24	96	On Bipartite Matching under the RMS Distance	claim
25	96	On Planar Path Transformation	claim
26	95	Shortest Descending Paths through Given Faces	claim
27	94	Rotationally Monotone Polygons	claim
28	92	Polygon Reconstruction from Line Cross-Sections	claim
29	92	Minimizing the Number of Arcs Linking a Permutation of Points in the Plane	claim
30	90	Predicates for Line Transversals in 3D	claim
31	87	Tight Bounds for Point Recolouring	claim
32	87	K-Nearest Neighbor Search using the Pyramid Technique	claim
33	87	Hamiltonian Cycles in Triangular Grids	claim
34	87	On the Maximum Span of Fixed-Angle Chains	claim
35	86	Optimal Polygon Placement	claim
36	77	Computational Euclid	claim
37	70	Polygons Flip Finitely: Flaws and a Fix	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers