The following pages link to (Q3992847):
Displaying 50 items.
- A lower bound for computing geometric spanners (Q265718) (← links)
- Optimization of the Hausdorff distance between sets in Euclidean space (Q265867) (← links)
- An improved algorithm for intersecting convex polygons (Q286975) (← links)
- On building the transitive reduction of a two-dimensional poset (Q287116) (← links)
- Detecting conjunctions of global predicates (Q287191) (← links)
- Towards optimal two-dimensional indexing for constraint databases (Q287206) (← links)
- A note on approximating graph genus (Q290221) (← links)
- Sparse dominance queries for many points in optimal time and space (Q293151) (← links)
- A polynomial time solution for labeling a rectilinear map (Q293240) (← links)
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Computing the optimal bridge between two convex polygons (Q294636) (← links)
- Triangulations without minimum-weight drawing (Q294766) (← links)
- A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- Setting defect charts control limits to balance cycle time and yield for a tandem production line (Q337306) (← links)
- Efficient heuristic algorithms for maximum utility product pricing problems (Q342312) (← links)
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- Euclidean chains and their shortcuts (Q391221) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- Computing convex quadrangulations (Q412380) (← links)
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- Optimal partition trees (Q420575) (← links)
- Energy-conserving contact interaction models for arbitrarily shaped discrete elements (Q423582) (← links)
- A quasi steady state method for solving transient Darcy flow in complex 3D fractured networks (Q425591) (← links)
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- Certifying algorithms (Q465678) (← links)
- The Hamiltonian properties of supergrid graphs (Q497690) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Top-\(k\) Manhattan spatial skyline queries (Q522965) (← links)
- Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach (Q540445) (← links)
- Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram (Q542397) (← links)
- Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- Estimates for the minimal width of polytopes inscribed in convex bodies (Q583611) (← links)
- Delaunay graphs are almost as good as complete graphs (Q584279) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- On the stretch factor of Delaunay triangulations of points in convex position (Q621926) (← links)
- Shape elongation from optimal encasing rectangles (Q623133) (← links)
- Efficient view point selection for silhouettes of convex polyhedra (Q634248) (← links)
- Reconstructing orthogonal polyhedra from putative vertex sets (Q634249) (← links)
- Conservative interpolation between volume meshes by local Galerkin projection (Q643933) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- The legacy of automatic mesh generation from solid modeling (Q672240) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- Tangent, normal, and visibility cones on Bézier surfaces (Q673488) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
