The following pages link to (Q3694703):
Displaying 50 items.
- Grid refinement in the construction of Lyapunov functions using radial basis functions (Q258399) (← links)
- Geometric partitioning and robust ad-hoc network design (Q271922) (← links)
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- (Approximate) uncertain skylines (Q359874) (← links)
- Approximate covering detection among content-based subscriptions using space filling curves (Q362593) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Minimum Hausdorff distance under rigid motions and comparison of protein structures (Q473041) (← links)
- Improved subquadratic 3SUM (Q513274) (← links)
- Opaque sets (Q517796) (← links)
- Line facility location in weighted regions (Q543511) (← links)
- Ectropy of diversity measures for populations in Euclidean space (Q545352) (← links)
- Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy (Q547283) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Guarding a set of line segments in the plane (Q630591) (← links)
- Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
- A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles (Q635380) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- A volume first maxima-finding algorithm (Q653324) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
- A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions (Q673501) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- Boundedness of level lines for two-dimensional random fields (Q674497) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- Randomized quickhull (Q675302) (← links)
- Barycentric coordinates for convex polytopes (Q675692) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Piecewise linear interpolants to Lagrange and Hermite convex scattered data (Q676935) (← links)
- A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← links)
- Finite nondense point set analysis (Q686052) (← links)
- Orienting polygonal parts without sensors (Q686743) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Efficiently updating constrained Delaunay triangulations (Q688628) (← links)
- A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (Q688835) (← links)
- On the asymptotics of trimmed best \(k\)-nets (Q700155) (← links)
- An optimal algorithm for one-separation of a set of isothetic polygons (Q707337) (← links)
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
- Construction of Voronoi diagrams in the plane by using maps (Q751861) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
- Finding minimal nested polygons (Q802901) (← links)
- Dynamic partition trees (Q804289) (← links)
