Pages that link to "Item:Q2552382"
From MaRDI portal
The following pages link to An efficient algorithm for determining the convex hull of a finite planar set (Q2552382):
Displaying 50 items.
- Iterative learning control based on extremum seeking (Q254596) (← links)
- Efficient operations on discrete paths (Q265059) (← links)
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Optimal convergence rate of the multitype sticky particle approximation of one-dimensional diagonal hyperbolic systems with monotonic initial data (Q321609) (← links)
- Fastest-path planning for direction-dependent speed functions (Q368729) (← links)
- Largest area convex hull of imprecise data based on axis-aligned squares (Q386441) (← links)
- Optimal eviction policies for stochastic address traces (Q386897) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Container of (min,+)-linear systems (Q457194) (← links)
- On steady state of continuous min-plus systems (Q481360) (← links)
- Max-plus singular values (Q498333) (← links)
- A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
- The maximal distance between imprecise point objects (Q533189) (← links)
- Inconstancy of finite and infinite sequences (Q533867) (← links)
- Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- On computing approximate convex hulls (Q584737) (← links)
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Computing equilibria in discounted dynamic games (Q668745) (← links)
- Randomized quickhull (Q675302) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- A simple algorithm for computing the smallest enclosing circle (Q750173) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Automatic generating and spread of a plastic region in PIES (Q785145) (← links)
- Linear time algorithms for convex and monotone approximation (Q792060) (← links)
- Delaunay triangulation and the convex hull of n points in expected linear time (Q799379) (← links)
- Invariants for time-series constraints (Q823762) (← 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)
- Compressing spatio-temporal trajectories (Q833705) (← links)
- Graham triangulations and triangulations with a center are Hamiltonean (Q835054) (← links)
- Integrated QoS-aware resource management and scheduling with multi-resource constraints (Q853620) (← links)
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- A sublogarithmic convex hull algorithm (Q911280) (← links)
- An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
- Numerical analyses of the boundary effect of radial basis functions in 3D surface reconstruction (Q925249) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Approximating a real number by a rational number with a limited denominator: a geometric approach (Q967407) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Random convex hulls and extreme value statistics (Q967627) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- Fast algorithms for the density finding problem (Q1024779) (← links)
- Highway hull revisited (Q1037778) (← links)
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
- A note on the expected time required to construct the outer layer (Q1062448) (← links)
- Lipschitz condition in minimum norm problems on bounded functions (Q1067133) (← links)
