The following pages link to (Q5452284):
Displaying 50 items.
- Data imprecision under \(\lambda\)-geometry model (Q527138) (← links)
- Binary plane partitions for disjoint line segments (Q540437) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- The multi-facility median problem with Pos/Neg weights on general graphs (Q609818) (← links)
- On the stretch factor of Delaunay triangulations of points in convex position (Q621926) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Connectivity guarantees for wireless networks with directional antennas (Q654284) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Accurate fluid-structure interaction computations using elements without mid-side nodes (Q657203) (← links)
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\) (Q664353) (← links)
- Path planning with divergence-based distance functions (Q668992) (← links)
- Variational implementation of immersed finite element methods (Q695904) (← links)
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle (Q708286) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Improved local algorithms for spanner construction (Q714769) (← links)
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs (Q714851) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- Diffusion-controlled reactions modeling in Geant4-DNA (Q728637) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- A fast algorithm for data collection along a fixed track (Q744105) (← links)
- RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point (Q746340) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- A Nitsche stabilized finite element method for embedded interfaces: application to fluid-structure interaction and rigid-body contact (Q776742) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- Closest-pair queries and minimum-weight queries are equivalent for squares (Q824331) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Strong connectivity of sensor networks with double antennae (Q896697) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Bundling three convex polygons to minimize area or perimeter (Q902419) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- Approximating a real number by a rational number with a limited denominator: a geometric approach (Q967407) (← links)
- A new fast heuristic for labeling points (Q987799) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Efficient \(c\)-oriented range searching with DOP-trees (Q1000927) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- The minimum speed for a blocking problem on the half plane (Q1023003) (← links)
