Pages that link to "Item:Q4635521"

The following pages link to Proceedings of the thirtieth annual symposium on Computational geometry (Q4635521):

Displaying 50 items.

• On triple intersections of three families of unit circles (Q908211) (← links)
• On the reconstruction of convex sets from random normal measurements (Q2349857) (← links)
• Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
• Liftings and stresses for planar periodic frameworks (Q2351014) (← links)
• Embeddability in the 3-Sphere Is Decidable (Q3177893) (← links)
• Counting and Enumerating Crossing-free Geometric Graphs (Q4635522) (← links)
• A Framework for Computing the Greedy Spanner (Q4635523) (← links)
• There are Plane Spanners of Maximum Degree 4 (Q4635524) (← links)
• New and Improved Spanning Ratios for Yao Graphs (Q4635525) (← links)
• On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures (Q4635526) (← links)
• Progressive Geometric Algorithms (Q4635527) (← links)
• On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp (Q4635528) (← links)
• The limited blessing of low dimensionality (Q4635529) (← links)
• Visualizing hyperbolic Voronoi diagrams (Q4635531) (← links)
• Optimal Geometric Flows via Dual Programs (Q4635532) (← links)
• Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems (Q4635533) (← links)
• Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons (Q4635534) (← links)
• A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs (Q4635535) (← links)
• Outerstring graphs are χ-bounded (Q4635536) (← links)
• Improved bounds for the conflict-free chromatic art gallery problem (Q4635537) (← links)
• Linear transformation distance for bichromatic matchings (Q4635538) (← links)
• Delaunay triangulations with disconnected realization spaces (Q4635539) (← links)
• Eliminating Tverberg Points, I. An Analogue of the Whitney Trick (Q4635540) (← links)
• Higher Dimensional Cheeger Inequalities (Q4635541) (← links)
• Incidences between points and lines in R4 (Q4635542) (← links)
• Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage (Q4635544) (← links)
• Smallest enclosing ball for probabilistic data (Q4635545) (← links)
• Peeling Potatoes Near-Optimally in Near-Linear Time (Q4635546) (← links)
• On the Complexity of Randomly Weighted Voronoi Diagrams (Q4635547) (← links)
• A Census of Plane Graphs with Polyline Edges (Q4635548) (← links)
• Using Convex Relaxations for Efficiently and Privately Releasing Marginals (Q4635550) (← links)
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
• Better embeddings for planar Earth-Mover Distance over sparse sets (Q4635552) (← links)
• Higher-Quality Tetrahedral Mesh Generation for Domains with Small Angles by Constrained Delaunay Refinement (Q4635553) (← links)
• Intersection of paraboloids and application to Minkowski-type problems (Q4635555) (← links)
• Efficient Random-Walk Methods for Approximating Polytope Volume (Q4635556) (← links)
• The Persistent Homology of Distance Functions under Random Projection (Q4635557) (← links)
• Computing Topological Persistence for Simplicial Maps (Q4635559) (← links)
• Induced Matchings of Barcodes and the Algebraic Stability of Persistence (Q4635560) (← links)
• Computing the Fréchet distance with shortcuts is NP-hard (Q4635561) (← links)
• The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4635562) (← links)
• Light spanners for Snowflake Metrics (Q4635563) (← links)
• Continuously Flattening Polyhedra Using Straight Skeletons (Q4635564) (← links)
• Two-Point L1 Shortest Path Queries in the Plane (Q4635565) (← links)
• Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels (Q4635566) (← links)
• Free Edge Lengths in Plane Graphs (Q4635567) (← links)
• Weight Balancing on Boundaries and Skeletons (Q4635568) (← links)
• Separation by Convex Pseudo-Circles (Q4635569) (← links)
• Euclidean Steiner Shallow-Light Trees (Q4635570) (← links)
• Measuring Distance between Reeb Graphs (Q4635572) (← links)