The following pages link to (Q4947407):
Displaying 50 items.
- The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640) (← links)
- Delaunay triangulations of closed Euclidean \(d\)-orbifolds (Q309648) (← links)
- Straight skeletons and mitered offsets of nonconvex polytopes (Q331386) (← links)
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions (Q353145) (← links)
- Sequential dependency computation via geometric data structures (Q390107) (← links)
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- On the central path problem (Q393050) (← links)
- Mining spatial colocation patterns: a different framework (Q408691) (← links)
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
- A sparse octree gravitational \(N\)-body code that runs entirely on the GPU processor (Q419652) (← links)
- Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Decomposable algorithms for nearest neighbor computing (Q436812) (← links)
- Living on the moon: topological optimization of a 3D-printed lunar shelter (Q468385) (← links)
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- An algorithm for continuous piecewise linear bounding of discrete time series data (Q486719) (← links)
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- Recursive learning for sparse Markov models (Q516456) (← links)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- Towards optimal range medians (Q541663) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- A consensus problem for a class of vehicles with 2-D dynamics (Q600882) (← links)
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis (Q618886) (← links)
- Arrangements on parametric surfaces. II: Concretizations and applications (Q626976) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- Weak equilibrium in a spatial model (Q637573) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- Spherical fast multiscale approximation by locally compact orthogonal wavelets (Q644415) (← links)
- The \(k\)-centrum straight-line location problem (Q655169) (← links)
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location (Q655203) (← links)
- Cutting a convex polyhedron out of a sphere (Q659695) (← links)
- On the structure of graphs with low obstacle number (Q659699) (← links)
- A note on the complexity of real algebraic hypersurfaces (Q659701) (← links)
- Data structures for extension violations in a query range (Q662125) (← links)
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
- Scalable continuous object detection and tracking in sensor networks (Q666040) (← links)
- Accelerating smooth molecular surface calculation (Q681666) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Spline-based reservoir's geometry reconstruction and mesh generation for coupled flow and mechanics simulation (Q723151) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- Sign-preserving of principal eigenfunctions in P1 finite element approximation of eigenvalue problems of second-order elliptic operators (Q728659) (← links)
- Parallelized event chain algorithm for dense hard sphere and polymer systems (Q728820) (← 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)
- The cyclical scheduling problem (Q744050) (← links)