The following pages link to (Q4295776):
Displaying 37 items.
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- From individual behaviour to an evaluation of the collective evolution of crowds along footbridges (Q524400) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- Dynamical geometry for multiscale dissipative particle dynamics (Q709399) (← links)
- Two disjoint 5-holes in point sets (Q827302) (← links)
- A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram (Q863827) (← links)
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets (Q967409) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- Exact computation of the sign of a finite sum (Q1294292) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Illumination of polygons with vertex lights (Q1350220) (← links)
- Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation (Q1371879) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592) (← links)
- Experimental results on quadrangulations of sets of fixed points (Q1608859) (← links)
- Computational simulation of the interactions between moving rigid bodies and incompressible two-fluid flows (Q1641286) (← links)
- An efficient algorithm for determining the extreme vertices of a moving 3D convex polyhedron with respect to a plane (Q1806579) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Optimal regulator for the inverted pendulum via Euler-Lagrange backward integration (Q1881211) (← links)
- All convex polyhedra can be clamped with parallel jaw grippers (Q1924713) (← links)
- Optimization methods for the planning of rapid transit systems (Q1971985) (← links)
- Local Delaunay-based high fidelity surface reconstruction from 3D point sets (Q2020339) (← links)
- A sampling type discernment approach towards reconstruction of a point set in \(\mathbb{R}^2\) (Q2020362) (← links)
- An input-independent single pass algorithm for reconstruction from dot patterns and boundary samples (Q2187368) (← links)
- Non-convex analytical and geometrical tools for volume truncation, initialization and conservation enforcement in VOF methods (Q2221457) (← links)
- Application of NEM in seepage analysis with a free surface (Q2227343) (← links)
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs (Q2383537) (← links)
- A wave-propagation based volume tracking method for compressible multicomponent flow in two space dimensions (Q2489035) (← links)
- On a decomposition of regular domains into John domains with uniform constants (Q5376676) (← links)
- Analytic Evaluation of Collocation Integrals for the Radiosity Equation (Q5717697) (← links)
- The Arlequin method as a flexible engineering design tool (Q5717806) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)
- No quadrangulation is extremely odd (Q6487985) (← links)
