The following pages link to (Q4947407):
Displayed 50 items.
- A consensus problem for a class of vehicles with 2-D dynamics (Q600882) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters (Q730922) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Gift-wrapping based preimage computation algorithm (Q834263) (← links)
- Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
- Optimal bounding cones of vectors in three dimensions (Q834998) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- The phase flow method (Q860291) (← links)
- Bayesian spatial modelling of gamma ray count data (Q862442) (← links)
- A new representation of orientable 2-manifold polygonal surfaces for geometric modelling (Q863841) (← links)
- The visibility-Voronoi complex and its applications (Q870429) (← links)
- Geometric dilation of closed planar curves: New lower bounds (Q883237) (← links)
- Guarding curvilinear art galleries with vertex or point guards (Q924067) (← links)
- Improved bounds on the union complexity of fat objects (Q946687) (← links)
- Adaptive spacetime meshing for discontinuous Galerkin methods (Q950398) (← links)
- Estimation of graphical models whose conditional independence graphs are interval graphs and its application to modelling linkage disequilibrium (Q961360) (← links)
- Capturing crossings: convex hulls of segment and plane intersections (Q963438) (← links)
- Boundary labeling with octilinear leaders (Q970611) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation (Q975537) (← links)
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004) (← links)
- Cooperative TSP (Q982655) (← links)
- Fast distance transformation on irregular two-dimensional grids (Q991938) (← links)
- GAPS: A clustering method using a new point symmetry-based distance measure (Q996422) (← links)
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries (Q1000921) (← links)
- Translational packing of arbitrary polytopes (Q1005325) (← links)
- Multiscale cell-based coarsening for discontinuous problems (Q1005684) (← links)
- Kinetic collision detection for convex fat objects (Q1016518) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- Shortest descending paths through given faces (Q1025303) (← links)
- Efficiency for continuous facility location problems with attraction and repulsion (Q1026586) (← links)
- Computing the update of the repeated median regression line in linear time (Q1028994) (← links)
- Clamshell casting (Q1031870) (← links)
- Practical multiagent rendezvous through modified circumcenter algorithms (Q1036666) (← links)
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation (Q1038471) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Casting a polyhedron with directional uncertainty (Q1405007) (← links)
- The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027) (← links)
- Approximation algorithms for terrain guarding. (Q1603553) (← links)
- How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case (Q1770724) (← links)
- An elementary algorithm for digital arc segmentation (Q1827813) (← links)
- Computing large planar regions in terrains, with an application to fracture surfaces (Q1827827) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- On the computational complexity of 2-interval pattern matching problems (Q1884946) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)