The following pages link to (Q4947407):
Displayed 50 items.
- Versioning Tree Structures by Path-Merging (Q3507324) (← links)
- Simplified Planar Coresets for Data Streams (Q3512444) (← links)
- Boundary Labeling with Octilinear Leaders (Q3512462) (← links)
- Workspace-Based Connectivity Oracle: An Adaptive Sampling Strategy for PRM Planning (Q3564291) (← links)
- Challenges and Advances in A Priori Routing (Q3564352) (← links)
- Discontinuous Galerkin framework for adaptive solution of parabolic problems (Q3587854) (← links)
- On planar intersection graphs with forbidden subgraphs (Q3605149) (← links)
- Maximum Neighbour Voronoi Games (Q3605489) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
- Model Predictive Control – Numerical Methods for the Invariant Sets Approximation (Q3615656) (← links)
- Critical Points of the Electric Field from a Collection of Point Charges (Q3628681) (← links)
- Estimating monotone convex functions via sequential shape modification (Q3638530) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- A Novel Algorithm for Distance Transformation on Irregular Isothetic Grids (Q3648808) (← links)
- Geometry Helps to Compare Persistence Diagrams (Q4577947) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- A Unified Approach for the $H_\infty$-Stability Analysis of Classical and Fractional Neutral Systems with Commensurate Delays (Q4604628) (← links)
- Obstacle Numbers of Planar Graphs (Q4625101) (← links)
- How to Block Blood Flow by Using Elastic Coil (Q4632167) (← links)
- Efficient and Qualified Mesh Generation for Gaussian Molecular Surface Using Adaptive Partition and Piecewise Polynomial Approximation (Q4637667) (← links)
- Separable Distance Transformation and Its Applications (Q4648753) (← links)
- On Quality Indicators for Black-Box Level Set Approximation (Q4649205) (← links)
- Multi-outlet retail site location assessment (Q4654428) (← links)
- A nonconforming Crouzeix-Raviart type finite element on polygonal meshes (Q4683165) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- Data structures for maintaining set partitions (Q4810507) (← links)
- Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract] (Q4916186) (← links)
- An Elementary Algorithm for Digital Arc Segmentation (Q4917111) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
- Solving the Direction Field for Discrete Agent Motion (Q4931249) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- A Deep Learning Approach for the Computation of Curvature in the Level-Set Method (Q4997376) (← links)
- Optimizing Query Perturbations to Enhance Shape Retrieval (Q5014706) (← links)
- On the number of regular vertices of the union of Jordan regions (Q5054868) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- On farthest Bregman Voronoi cells (Q5077159) (← links)
- (Q5088939) (← links)
- CONVEX HULLS OF SIERPIŃSKI RELATIVES (Q5107205) (← links)
- (Q5111239) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- New Bounds for Range Closest-Pair Problems (Q5116533) (← links)
- Transition scale-spaces: A computational theory for the discretized entorhinal cortex (Q5131177) (← links)
- Minkowski tensors of anisotropic spatial structure (Q5141542) (← links)
- Compensated Convexity Methods for Approximations and Interpolations of Sampled Functions in Euclidean Spaces: Applications to Contour Lines, Sparse Data, and Inpainting (Q5230416) (← links)
- Analytical solutions of optimal portfolio rebalancing (Q5234320) (← links)
- Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning (Q5308326) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)
- Processing an Offline Insertion-Query Sequence with Applications (Q5321704) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions (Q5387782) (← links)