Pages that link to "Item:Q3358264"

The following pages link to Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms (Q3358264):

Displaying 50 items.

• On shortest disjoint paths in planar graphs (Q429668) (← links)
• Adaptive skin meshes coarsening for biomolecular simulation (Q554627) (← links)
• Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
• A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
• A robust and efficient hybrid cut-cell/ghost-cell method with adaptive mesh refinement for moving boundaries on irregular domains (Q653634) (← links)
• A general approach to the analysis of controlled perturbation algorithms (Q654290) (← links)
• Polyhedral perturbations that preserve topological form (Q672157) (← links)
• Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions (Q673501) (← links)
• Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
• PAINT: Pareto front interpolation for nonlinear multiobjective optimization (Q694527) (← links)
• \texttt{ColDICE}: A parallel Vlasov-Poisson solver using moving adaptive simplicial tessellation (Q726973) (← links)
• A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
• Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree (Q733556) (← links)
• A genus oblivious approach to cross parameterization (Q735512) (← links)
• Order-k Voronoi diagrams of sites with additive weights in the plane (Q802900) (← links)
• Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
• Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
• On finding a widest empty 1-corner corridor (Q844199) (← links)
• Meshing skin surfaces with certified topology (Q868105) (← links)
• Separating bichromatic point sets by L-shapes (Q904108) (← links)
• Applied computational geometry: Towards robust solutions of basic problems (Q915501) (← links)
• The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
• Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
• A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
• Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
• Cutting hyperplane arrangements (Q1176317) (← links)
• Triangulating a simple polygon in linear time (Q1176324) (← links)
• A role of lower semicontinuous functions in the combinatorial complexity of geometric problems (Q1179028) (← links)
• Randomized optimal algorithm for slope selection (Q1182097) (← links)
• Delaunay triangulations in three dimensions with finite precision arithmetic (Q1195754) (← links)
• Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
• A perturbation scheme for spherical arrangements with application to molecular modeling (Q1265287) (← links)
• Sign determination in residue number systems (Q1274813) (← links)
• On the definition and the construction of pockets in macromolecules (Q1281762) (← links)
• Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) (Q1334932) (← links)
• \(k\)-violation linear programming (Q1336744) (← links)
• Gerris: A tree-based adaptive solver for the incompressible Euler equations in complex geometries. (Q1410891) (← links)
• Kinetic collision detection between two simple polygons. (Q1428461) (← links)
• Ham-sandwich cuts for abstract order types (Q1702128) (← links)
• Polynomial-sized topological approximations using the permutahedron (Q1739197) (← links)
• Smooth kinetic maintenance of clusters (Q1775777) (← 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)
• Applications of random sampling in computational geometry. II (Q1823685) (← links)
• An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
• Computing contour trees in all dimensions (Q1869743) (← links)
• The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra (Q1873157) (← links)
• The union of balls and its dual shape (Q1892419) (← links)
• On geometric optimization with few violated constraints (Q1906043) (← links)