The following pages link to (Q3694703):
Displaying 50 items.
- Surfaces over Dirichlet tessellations (Q805136) (← links)
- Using Gale transforms in computational geometry (Q805285) (← links)
- Construction of three-dimensional Delaunay triangulations using local transformations (Q807005) (← links)
- Rectifiable sets and the traveling salesman problem (Q807767) (← links)
- Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (Q833568) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- A new representation of orientable 2-manifold polygonal surfaces for geometric modelling (Q863841) (← links)
- Optimal algorithms for some polygon enclosure problems for VLSI layout analysis (Q864923) (← links)
- Stable marker-particle method for the Voronoi diagram in a flow field (Q875380) (← links)
- An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing (Q878095) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Approximate polytope ensemble for one-class classification (Q898344) (← links)
- A sublogarithmic convex hull algorithm (Q911280) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Hidden surface removal for rectangles (Q918209) (← links)
- An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- A weak characterisation of the Delaunay triangulation (Q934653) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- The indecomposability problem in binary morphology: an algebraic approach (Q960487) (← links)
- Mathematical morphological operations of boundary-represented geometric objects. (Q960488) (← links)
- Local tests for consistency of support hyperplane data. (Q960495) (← links)
- On covering problems of Rado (Q970613) (← links)
- Categorization generated by extended prototypes -- an axiomatic approach (Q995652) (← links)
- Active sampling for multiple output identification (Q1009223) (← links)
- A discrete element approach to evaluate stresses due to line loading on an elastic half-space (Q1015659) (← links)
- A univariate global search working with a set of Lipschitz constants for the first derivative (Q1024739) (← links)
- Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems (Q1026575) (← links)
- A fuzzy model for linear regression (Q1048560) (← links)
- On a circle placement problem (Q1062430) (← links)
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
- On the dynamization of data structures (Q1095647) (← links)
- Inequalities for curves of constant breadth (Q1100728) (← links)
- Computing the volume of the union of spheres (Q1104079) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- On-line sorting of twisted sequences in linear time (Q1104753) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- Systolic algorithms for computational geometry problems - a survey (Q1121668) (← links)
- Fat arcs: A bounding region with cubic convergence (Q1122928) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- Euclidean geometry in terms of automata theory (Q1124346) (← links)
- Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes (Q1126674) (← links)
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays (Q1176071) (← links)
- A result about the power of geometric oracle machines (Q1177163) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
