The following pages link to (Q3992847):
Displaying 36 items.
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
- Distribution-sensitive algorithms (Q5054869) (← links)
- The -Delaunay tessellation: Description of the model and geometry of typical cells (Q5055367) (← links)
- A linear-time heuristic for minimum rectangular coverings (Extended abstract) (Q5055944) (← links)
- Gaussian random fields: with and without covariances (Q5080403) (← links)
- (Q5088955) (← links)
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle (Q5089159) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model (Q5090986) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- Concatenable segment trees (Q5096181) (← links)
- On computing the initial data for modeling of radiation-induced effects in porous materials (Q5110499) (← links)
- K-Dominance in Multidimensional Data: Theory and Applications (Q5111754) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- (Q5140773) (← links)
- Solution Reconstruction on Unstructured Tetrahedral Meshes Using<i>P</i><sup>1</sup>-Conservative Interpolation (Q5153687) (← links)
- Computational Origami Construction as Constraint Solving and Rewriting (Q5403476) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027) (← links)
- A quantum search algorithm of two-dimensional convex hull (Q6042499) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
- Improved bound for the Gerver-Ramsey collinearity problem (Q6080207) (← links)
- On one approach to the estimation of a triangular element degeneration in a triangulation (Q6095200) (← links)
- Topology optimization of light structures using the natural neighbour radial point interpolation method (Q6113565) (← links)
- Intersection graphs of maximal sub-polygons of \(k\)-lizards (Q6117086) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem (Q6154939) (← links)
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (Q6162512) (← links)
- Kernel-based construction operators for Boolean sum and ruled geometry (Q6170343) (← links)
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)
- Robust numerical integration of embedded solids described in boundary representation (Q6185230) (← links)
- Estimation of tetrahedron degeneration in a tetrahedral partition of three-dimensional space (Q6194431) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)
- Optimal line bipartitions of point sets (Q6487424) (← links)
- Some geometric lower bounds (Q6487948) (← links)
