Pages that link to "Item:Q3602849"
From MaRDI portal
The following pages link to Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Q3602849):
Displaying 37 items.
- Happy endings for flip graphs (Q2968066) (← links)
- A space-optimal data-stream algorithm for coresets in the plane (Q3602850) (← links)
- A PTAS for k-means clustering based on weak coresets (Q3602851) (← links)
- Bi-criteria linear-time approximations for generalized k-mean/median/center (Q3602852) (← links)
- Guard placement for efficient point-in-polygon proofs (Q3602853) (← links)
- Thick non-crossing paths and minimum-cost flows in polygonal domains (Q3602854) (← links)
- Finding curvature-constrained paths that avoid polygonal obstacles (Q3602855) (← links)
- Shortest paths on realistic polyhedra (Q3602856) (← links)
- Querying approximate shortest paths in anisotropic regions (Q3602857) (← links)
- Embedding 3-polytopes on a small grid (Q3602860) (← links)
- Computing the exact arrangement of circles on a sphere, with applications in structural biology (Q3602861) (← links)
- Visualizing bregman voronoi diagrams (Q3602862) (← links)
- Medial axis approximation from inner Voronoi balls (Q3602863) (← links)
- Inflating the cube by shrinking (Q3602864) (← links)
- Heilbronn's triangle problem (Q3602865) (← links)
- Kinetic 3D convex hulls via self-adjusting computation (Q3602867) (← links)
- Towards an implementation of the 3D visibility skeleton (Q3602868) (← links)
- An optimal generalization of the centerpoint theorem, and its extensions (Q3602869) (← links)
- Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams (Q3602871) (← links)
- Snap rounding of Bézier curves (Q3602872) (← links)
- Optimal simplification of polygonal chain for rendering (Q3602873) (← links)
- Distributed computation of virtual coordinates (Q3602876) (← links)
- On regular vertices on the union of planar objects (Q3602877) (← links)
- Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension (Q3602880) (← links)
- On the hardness of minkowski addition and related operations (Q3602888) (← links)
- On the exact maximum complexity of Minkowski sums of convex polyhedra (Q3602890) (← links)
- On approximate halfspace range counting and relative epsilon-approximations (Q3602891) (← links)
- A data structure for multi-dimensional range reporting (Q3602892) (← links)
- Tight bounds for dynamic convex hull queries (again) (Q3602893) (← links)
- Kinetic KD-trees and longest-side KD-trees (Q3602894) (← links)
- Embeddings of surfaces, curves, and moving points in euclidean space (Q3602895) (← links)
- Aperture-angle and Hausdorff-approximation of convex figures (Q5900486) (← links)
- Traversing a set of points with a minimum number of turns (Q5901403) (← links)
- Streaming algorithms for line simplification (Q5901404) (← links)
- Manifold reconstruction in arbitrary dimensions using witness complexes (Q5901405) (← links)
- On approximate range counting and depth (Q5901406) (← links)
- Fully dynamic geometric spanners (Q5901407) (← links)
