CCCG 2010 - PDF Preprint Papers

CCCG 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCCG-2010 Paper

click to vote

CCCG
2010

286views Computational Geometry» more CCCG 2010»

The projection median of a set of points in Rd

14 years 1 months ago

Download cccg.ca

The projection median of a finite set of points in R2 was introduced by Durocher and Kirkpatrick [5]. They proved the projection median in R2 provides a better approximation of th...

Riddhipratim Basu, Bhaswar Bhattacharya, Tanmoy Ta...

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	286	The projection median of a set of points in Rd	claim
2	242	Finding monochromatic l-shapes in bichromatic point sets	claim
3	231	Computing the straight skeleton of a monotone polygon in O(n log n) time	claim
4	224	Approximating the independent domatic partition problem in random geometric graphs - an experimental study	claim
5	222	3d local algorithm for dominating sets of unit disk graphs	claim
6	212	New variations of the reverse facility location problem	claim
7	203	I/O-efficient triangular range search and its application	claim
8	200	Determining the robustness of sensor barriers	claim
9	199	Direction assignment in wireless networks	claim
10	195	Minimum enclosing area triangle with a fixed angle	claim
11	190	Some properties of higher order delaunay and gabriel graphs	claim
12	189	Blocking delaunay triangulations	claim
13	189	Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons	claim
14	186	An optimal solution for dynamic polar diagram	claim
15	180	Watchman route in a simple polygon with a rubberband algorithm	claim
16	175	The 3-dimensional searchlight scheduling problem	claim
17	173	Small strong epsilon nets	claim
18	172	Cluster connecting problem inside a polygon	claim
19	172	Orthogonal thickness of graphs	claim
20	171	Connected dominating sets on dynamic geometric graphs	claim
21	170	Oja medians and centers of gravity	claim
22	169	Hausdorff core of a one reflex vertex polygon	claim
23	168	Coloring geometric hypergraph defined by an arrangement of half-planes	claim
24	167	Visibility maintenance of a moving segment observer inside polygons with holes	claim
25	166	Combinatorial changes of euclidean minimum spanning tree of moving points in the plane	claim
26	166	On stretch minimization problem on unit strip paper	claim
27	164	I/O efficient path traversal in well-shaped tetrahedral meshes	claim
28	162	Complete enumeration of small realizable oriented matroids	claim
29	162	Watchman tours for polygons with holes	claim
30	161	Fast local searches and updates in bounded universes	claim
31	159	Multi-guard covers for polygonal regions	claim
32	159	Those ubiquitous cut polyhedra	claim
33	158	Compatible pointed pseudo-triangulations	claim
34	158	Constrained k-center and movement to independence	claim
35	157	Approximating range-aggregate queries using coresets	claim
36	157	On degeneracy of lower envelopes of algebraic surfaces	claim
37	157	A new algorithm and improved lower bound for point placement on a line in two rounds	claim
38	157	Finding minimal bases in arbitrary spline spaces	claim
39	156	k-star-shaped polygons	claim
40	156	On polygons excluding point sets	claim
41	156	On the variance of random polygons	claim
42	156	Any monotone boolean function can be realized by interlocked polygons	claim
43	154	On a dispersion problem in grid labeling	claim
44	154	Optimal encoding of triangular and quadrangular meshes with fixed topology	claim
45	154	Deflating polygons to the limit	claim
46	154	Maximum geodesic routing in the plane with obstacles	claim
47	152	Stable roommates and geometric spanners	claim
48	151	On the perimeter of fat objects	claim
49	151	Robot kabaddi	claim
50	151	Minimum-area drawings of plane 3-trees	claim
51	151	Bounded-degree polyhedronization of point sets	claim
52	150	Approximate euclidean ramsey theorems	claim
53	148	The traveling salesman problem for lines and rays in the plane	claim
54	148	Ghost chimneys	claim
55	147	Evading equilateral triangles without a map	claim
56	145	Zipper unfoldings of polyhedral complexes	claim
57	145	k-sets and continuous motion in R3	claim
58	145	Regular labelings and geometric structures	claim
59	145	Towards a dynamic data structure for efficient bounded line range search	claim
60	142	Existence of zone diagrams in compact subsets of uniformly convex spaces	claim
61	141	Triangulations with many points of even degree	claim
62	140	Six-way equipartitioning by three lines in the plane	claim
63	135	Computing straight skeletons of planar straight-line graphs based on motorcycle graphs	claim
64	133	Range aggregate structures for colored geometric objects	claim
65	126	Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers