The following pages link to (Q3992847):
Displaying 50 items.
- Visibility graphs of towers (Q676570) (← links)
- Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
- Towards exact geometric computation (Q676577) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object (Q688223) (← links)
- Reconstructing sets of orthogonal line segments in the plane (Q688265) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Some problems in distributed computational geometry (Q719317) (← links)
- Finding an Euclidean anti-\(k\)-centrum location of a set of points (Q732894) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- On the modality of convex polygons (Q748888) (← links)
- Upper bounds on geometric permutations for convex sets (Q748890) (← links)
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- A simple algorithm for computing the smallest enclosing circle (Q750173) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- Automatic analysis of one-parameter planar ordinary differential equations by intelligent numeric simulation (Q751202) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Bisectors of linearly separable sets (Q753504) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form (Q789728) (← links)
- On the maximum empty rectangle problem (Q796307) (← links)
- On the definition and computation of rectilinear convex hulls (Q802314) (← links)
- Convex hulls of objects bounded by algebraic curves (Q802894) (← links)
- On sorting triangles in a Delaunay tessellation (Q802898) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Implementation of an adaptive algorithm for Richardson's method (Q808615) (← links)
- Metric trees (Q808798) (← links)
- Minimally separating sets, mediatrices, and Brillouin spaces (Q820096) (← links)
- Fifty new invariants of \(N\)-periodics in the elliptic billiard (Q823824) (← links)
- A linear optimization oracle for zonotope computation (Q824329) (← links)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
- Computation of spatial skyline points (Q827323) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Diagonal generalizaton of the DIRECT method for problems with constraints (Q828532) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Gift-wrapping based preimage computation algorithm (Q834263) (← links)
- Tangential cover for thick digital curves (Q834266) (← links)
- HCPO: an efficient insertion order for incremental Delaunay triangulation (Q834986) (← links)
- A note on maximum independent set and related problems on box graphs (Q835020) (← links)
- On the all-farthest-segments problem for a planar set of points (Q845846) (← links)
