Pages that link to "Item:Q3358264"
From MaRDI portal
The following pages link to Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms (Q3358264):
Displaying 50 items.
- Incremental topological flipping works for regular triangulations (Q1908263) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Discrete Lagrangian algorithm for finding geodesics on triangular meshes (Q1985213) (← links)
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching (Q2127711) (← links)
- Partial optimal transport for a constant-volume Lagrangian mesh with free boundaries (Q2134761) (← links)
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) (Q2135626) (← links)
- Computing multiparameter persistent homology through a discrete Morse-based approach (Q2206721) (← links)
- Parallel computation of alpha complexes for biomolecules (Q2206738) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Čech-Delaunay gradient flow and homology inference for self-maps (Q2221301) (← links)
- There are simple and robust refinements (almost) as good as Delaunay (Q2229908) (← links)
- Improved approximate Rips filtrations with shifted integer lattices and cubical complexes (Q2239807) (← links)
- A dynamic sampling approach towards computing Voronoi diagram of a set of circles (Q2243180) (← links)
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization (Q2349520) (← links)
- Edge insertion for optimal triangulations (Q2368129) (← links)
- On topological changes in the Delaunay triangulation of moving points (Q2391707) (← links)
- Morse connection graphs for piecewise constant vector fields on surfaces (Q2443050) (← links)
- Robust computation of Morse-Smale complexes of bilinear functions (Q2443058) (← links)
- Approximating polyhedral objects with deformable smooth surfaces (Q2462735) (← links)
- Visibility maps of segments and triangles in 3D (Q2477193) (← links)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties (Q2482216) (← links)
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). (Q2482899) (← links)
- Preferred directions for resolving the non-uniqueness of Delaunay triangulations (Q2489018) (← links)
- Multiparametric linear programming with applications to control (Q2512098) (← links)
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions (Q2796411) (← links)
- Crushing Disks Efficiently (Q2819490) (← links)
- The complexity of the node capacitated in-tree packing problem (Q2892141) (← links)
- Repairing unstructured triangular mesh intersections (Q2952164) (← links)
- 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
- SINK INSERTION FOR MESH IMPROVEMENT (Q3021948) (← links)
- Coupled hard-soft tissue simulation with contact and constraints applied to jaw-tongue-hyoid dynamics (Q3083829) (← links)
- Exact Fast Parallel Intersection of Large 3-D Triangular Meshes (Q3296633) (← links)
- Semi-dynamic Connectivity in the Plane (Q3449810) (← links)
- Robust Detection of Singularities in Vector Fields (Q3454940) (← links)
- Removing degeneracy may require unbounded dimension increase (Q3503459) (← links)
- FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION (Q3527439) (← links)
- Intelligent Solutions for Curve Reconstruction Problem (Q3628364) (← links)
- Robust Point-Location in Generalized Voronoi Diagrams (Q3628374) (← links)
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
- A Complete Implementation for Computing General Dimensional Convex Hulls (Q4513209) (← links)
- A Robust Implementation for Three-Dimensional Delaunay Triangulations (Q4513210) (← links)
- A simple method for resolving degeneracies in Delaunay triangulations (Q4630259) (← links)
- (Q4631275) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- TOPOLOGICAL PEELING AND APPLICATIONS (Q4818578) (← links)
- Infimaximal Frames: A Technique for Making Lines Look Like Segments (Q4818582) (← links)
- Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
- A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124) (← links)
- (Q5088939) (← links)
- (Q5111239) (← links)
