The following pages link to Computational Geometry in C (Q4226067):
Displaying 50 items.
- Locating a single facility and a high-speed line (Q299840) (← links)
- Kinetic clustering of points on the line (Q301594) (← links)
- Algorithms for interactive Sprouts (Q307772) (← links)
- \(hp\)-boundary layer mesh sequences with applications to shell problems (Q316574) (← links)
- Modeling of Ocean-atmosphere interaction phenomena during the breaking of modulated wave trains (Q349260) (← links)
- Numerical simulation of pyroclastic density currents using locally refined Cartesian grids (Q365266) (← links)
- A collocated finite volume embedding method for simulation of flow past stationary and moving body (Q416715) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- TURBINS: an immersed boundary, Navier-Stokes code for the simulation of gravity and turbidity currents interacting with complex topographies (Q534575) (← links)
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction (Q648916) (← links)
- Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms (Q654384) (← links)
- Finite difference scheme for solving general 3D convection-diffusion equation (Q709646) (← links)
- Cellwise conservative unsplit advection for the volume of fluid method (Q728962) (← links)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
- Linearly interpolated FDH efficiency score for nonconvex frontiers (Q853945) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- Bounds for point recolouring in geometric graphs (Q924089) (← links)
- A new algorithm for computing the convex hull of a planar point set (Q926679) (← links)
- Efficient generation of simple polygons for characterizing the shape of a set of points in the plane (Q936454) (← links)
- Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows (Q1005511) (← links)
- A sweep-line algorithm for spatial clustering (Q1009933) (← links)
- Morphing polyhedra with parallel faces: Counterexamples (Q1025295) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Rotationally monotone polygons (Q1025304) (← links)
- A discontinuous stabilized mortar method for general 3D elastic problems (Q1033520) (← links)
- Parameter identification of 1D fractal interpolation functions using bounding volumes (Q1034661) (← links)
- An immersed-boundary method for compressible viscous flows (Q1043161) (← links)
- On computing the optimal bridge between two convex polygons. (Q1603485) (← links)
- On the suitability of the immersed boundary method for the simulation of high-Reynolds-number separated turbulent flows (Q1646887) (← links)
- A novel model of conforming Delaunay triangulation for sensor network configuration (Q1669119) (← links)
- \(\alpha\)-concave hull, a generalization of convex hull (Q1676320) (← links)
- Computational method for phase space transport with applications to Lobe dynamics and rate of escape (Q1695058) (← links)
- Energy efficient low-cost virtual backbone construction for optimal routing in wireless sensor networks (Q1718194) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- An alternating heuristic for medianoid and centroid problems in the plane (Q1870807) (← links)
- The visibility graph of congruent discs is Hamiltonian (Q1873692) (← links)
- Kinetic Euclidean minimum spanning tree in the plane (Q1932347) (← links)
- An efficient algorithm for the calculation of sub-grid distances for higher-order LBM boundary conditions in a GPU simulation environment (Q2004461) (← links)
- Exploration of new limiter schemes for stress tensors in Lagrangian and ALE hydrocodes (Q2014883) (← links)
- Immersed boundary conditions for hypersonic flows using ENO-like least-square reconstruction (Q2028173) (← links)
- Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
- A polygonal approximation for general 4-contours corresponding to weakly simple curves (Q2127283) (← links)
- Optimal area polygonization problems: exact solutions through geometric duality (Q2147134) (← links)
- A sharp-interface immersed boundary method for moving objects in compressible viscous flows (Q2176852) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
