Pages that link to "Item:Q5405855"

The following pages link to Proceedings of the twenty-sixth annual symposium on Computational geometry (Q5405855):

Displaying 50 items.

• Steinitz Theorems for Orthogonal Polyhedra (Q2968117) (← links)
• Optimal partition trees (Q5405856) (← links)
• Consistent digital line segments (Q5405857) (← links)
• The geometry of flocking (Q5405858) (← links)
• Tight lower bounds for halfspace range searching (Q5405859) (← links)
• Discrete geometric structures for architecture (Q5405860) (← links)
• Better bounds on the union complexity of locally fat objects (Q5405861) (← links)
• On the complexity of sets of free lines and line segments among balls in three dimensions (Q5405862) (← links)
• Lines avoiding balls in three dimensions revisited (Q5405863) (← links)
• Adding one edge to planar graphs makes crossing number hard (Q5405864) (← links)
• Planar visibility (Q5405865) (← links)
• The 2-center problem in three dimensions (Q5405866) (← links)
• Linkless and flat embeddings in 3-space and the unknot problem (Q5405867) (← links)
• Visualizing 3D Euler spirals (Q5405868) (← links)
• Shape approximation using k-order alpha-hulls (Q5405869) (← links)
• Constructing Reeb graphs using cylinder maps (Q5405871) (← links)
• Convexification of polygons by length preserving transformations (Q5405872) (← links)
• Geometric methods for multi-agent collision avoidance (Q5405873) (← links)
• A geometric approach to collective motion (Q5405874) (← links)
• Kinetic stable Delaunay graphs (Q5405875) (← links)
• A kinetic triangulation scheme for moving points in the plane (Q5405876) (← links)
• Output-sensitive algorithm for the edge-width of an embedded graph (Q5405877) (← links)
• Finding shortest non-trivial cycles in directed graphs on surfaces (Q5405878) (← links)
• Approximating loops in a shortest homology basis from point data (Q5405879) (← links)
• A traveller's problem (Q5405880) (← links)
• A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane (Q5405881) (← links)
• New constructions of SSPDs and their applications (Q5405882) (← links)
• The complexity of the normal surface solution space (Q5405883) (← links)
• Distance <i>k</i> -sectors exist (Q5405884) (← links)
• Zone diagrams in Euclidean spaces and in other normed spaces (Q5405885) (← links)
• Klee's measure problem on fat boxes in time ∂( <i>n</i> ^{( <i>d</i> +2)/3} ) (Q5405886) (← links)
• An improved algorithm for computing the volume of the union of cubes (Q5405887) (← links)
• Orthogonal range reporting (Q5405888) (← links)
• A dynamic data structure for approximate range searching (Q5405889) (← links)
• The tidy set (Q5405890) (← links)
• A randomized <i>O</i> ( <i>m</i> log <i>m</i> ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes (Q5405891) (← links)
• Topological inference via meshing (Q5405892) (← links)
• Geometric tomography with topological guarantees (Q5405893) (← links)
• On degrees in random triangulations of point sets (Q5405894) (← links)
• Acute triangulations of polyhedra and the Euclidean space (Q5405895) (← links)
• Dynamic well-spaced point sets (Q5405896) (← links)
• Manifold reconstruction using tangential Delaunay complexes (Q5405897) (← links)
• Optimal reconstruction might be hard (Q5405898) (← links)
• Reconstructing shapes with guarantees by unions of convex sets (Q5405899) (← links)
• Improving the first selection lemma in R ³ (Q5405900) (← links)
• Points with large quadrant-depth (Q5405901) (← links)
• Approximating the Fréchet distance for realistic curves in near linear time (Q5405902) (← links)
• Computing similarity between piecewise-linear functions (Q5405903) (← links)
• Applications of geometry and topology for quadrilateral meshprocessing and verifiable visualization (Q5405904) (← links)
• Computing planar Voronoi diagrams in double precision (Q5405905) (← links)