COMPGEOM 2010 - PDF Preprint Papers

COMPGEOM 2010 ACM Symposium on Computational Geometry

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMPGEOM-2010 Paper

click to vote

COMPGEOM
2010
ACM

236views Discrete Geometry» more COMPGEOM 2010»

3D Euler spirals for 3D curve completion

13 years 9 months ago

Download webee.technion.ac.il

Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper deﬁnes a new type of 3D curves, which can be utilized for curv...

Gur Harary, Ayellet Tal

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	236	3D Euler spirals for 3D curve completion	claim
2	235	Constructing Reeb graphs using cylinder maps	claim
3	221	Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements	claim
4	215	Adding one edge to planar graphs makes crossing number hard	claim
5	213	A dynamic data structure for approximate range searching	claim
6	211	The 2-center problem in three dimensions	claim
7	210	Finding shortest non-trivial cycles in directed graphs on surfaces	claim
8	196	Manifold reconstruction using tangential Delaunay complexes	claim
9	187	Visualizing 3D Euler spirals	claim
10	174	Linkless and flat embeddings in 3-space and the unknot problem	claim
11	170	Better bounds on the union complexity of locally fat objects	claim
12	163	On degrees in random triangulations of point sets	claim
13	159	A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes	claim
14	159	A kinetic triangulation scheme for moving points in the plane	claim
15	158	Computing similarity between piecewise-linear functions	claim
16	157	New constructions of SSPDs and their applications	claim
17	153	Tangencies between families of disjoint regions in the plane	claim
18	151	Approximating loops in a shortest homology basis from point data	claim
19	151	The complexity of the normal surface solution space	claim
20	148	Consistent digital line segments	claim
21	147	On the complexity of sets of free lines and line segments among balls in three dimensions	claim
22	147	The tidy set: a minimal simplicial set for computing homology of clique complexes	claim
23	146	Geometric tomography with topological guarantees	claim
24	144	Output-sensitive algorithm for the edge-width of an embedded graph	claim
25	142	Reconstructing shapes with guarantees by unions of convex sets	claim
26	142	Optimal reconstruction might be hard	claim
27	138	Improving the first selection lemma in R3	claim
28	138	Dynamic well-spaced point sets	claim
29	137	Kinetic stable Delaunay graphs	claim
30	129	Optimal partition trees	claim
31	125	Lines avoiding balls in three dimensions revisited	claim
32	125	Incidences in three dimensions and distinct distances in the plane	claim
33	121	Tight lower bounds for halfspace range searching	claim
34	114	Topological inference via meshing	claim
35	107	Points with large quadrant-depth	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers