COMPGEOM 2009 - PDF Preprint Papers

COMPGEOM 2009 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2009 Paper

click to vote

COMPGEOM
2009
ACM

203views Discrete Geometry» more COMPGEOM 2009»

Parallel geometric algorithms for multi-core computers

13 years 11 months ago

Download hal.inria.fr

Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that speciﬁcally target this envi...

Vicente H. F. Batista, David L. Millman, Sylvain P...

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	203	Parallel geometric algorithms for multi-core computers	claim
2	180	Computing hereditary convex structures	claim
3	172	Integral estimation from point cloud in d-dimensional space: a geometric view	claim
4	170	A general approach for cache-oblivious range reporting and approximate range counting	claim
5	159	Approximate center points with proofs	claim
6	156	High resolution surface reconstruction from overlapping multiple-views	claim
7	152	Cache-oblivious range reporting with optimal queries requires superlinear space	claim
8	147	Geometric tomography: a limited-view approach for computed tomography	claim
9	144	Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension	claim
10	140	Straight skeletons of three-dimensional polyhedra	claim
11	134	Approximation algorithms for maximum independent set of pseudo-disks	claim
12	134	Minimum cuts and shortest homologous cycles	claim
13	133	Coresets for polytope distance	claim
14	130	On the set multi-cover problem in geometric settings	claim
15	127	The scale axis picture show	claim
16	123	PTAS for geometric hitting set problems via local search	claim
17	123	Distributed vision with smart pixels	claim
18	122	Minimum Manhattan network is NP-complete	claim
19	120	Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach	claim
20	114	Cut locus and topology from surface point data	claim
21	113	Quadrilateral meshes with bounded minimum angle	claim
22	113	Near-linear approximation algorithms for geometric hitting sets	claim
23	113	Binary plane partitions for disjoint line segments	claim
24	112	Lower bounds for weak epsilon-nets and stair-convexity	claim
25	111	Epsilon nets and union complexity	claim
26	107	Area-universal rectangular layouts	claim
27	106	Proximity of persistence modules and their diagrams	claim
28	106	The scale axis transform	claim
29	105	Persistent cohomology and circular coordinates	claim
30	105	Divide-and-conquer for Voronoi diagrams revisited	claim
31	104	Shooting permanent rays among disjoint polygons in the plane	claim
32	100	k-means requires exponentially many iterations even in the plane	claim
33	97	Randomly removing g handles at once	claim
34	94	On the topology of planar algebraic curves	claim
35	94	On grids in topological graphs	claim
36	93	Zigzag persistent homology and real-valued functions	claim
37	92	Halving lines and measure concentration in the plane	claim
38	91	Embedding rivers in polyhedral terrains	claim
39	91	Kinetic spanners in Rd	claim
40	89	An improved bound on the number of unit area triangles	claim
41	83	Visibility maps of realistic terrains have linear smoothed complexity	claim
42	81	Diameter of polyhedra: limits of abstraction	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers