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

181views Computational Geometry» more CCCG 2010»

The projection median of a set of points in Rd

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers