Computational Geometry in C
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Computational aspects related to convexity (52B55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited in
(only showing first 100 items - show all)- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
- A sweep-line algorithm for spatial clustering
- Morphing polyhedra with parallel faces: Counterexamples
- Single facility collection depots location problem in the plane
- Dynamic ham-sandwich cuts in the plane
- Rotationally monotone polygons
- A discontinuous stabilized mortar method for general 3D elastic problems
- Parameter identification of 1D fractal interpolation functions using bounding volumes
- An immersed-boundary method for compressible viscous flows
- Axioms and hulls
- On computing the optimal bridge between two convex polygons.
- On the suitability of the immersed boundary method for the simulation of high-Reynolds-number separated turbulent flows
- A novel model of conforming Delaunay triangulation for sensor network configuration
- \(\alpha\)-concave hull, a generalization of convex hull
- Computational method for phase space transport with applications to Lobe dynamics and rate of escape
- Energy efficient low-cost virtual backbone construction for optimal routing in wireless sensor networks
- Optimizing a constrained convex polygonal annulus
- Recent progress in exact geometric computation
- Linear time approximation of 3D convex polytopes
- An alternating heuristic for medianoid and centroid problems in the plane
- The visibility graph of congruent discs is Hamiltonian
- Kinetic Euclidean minimum spanning tree in the plane
- An efficient algorithm for the calculation of sub-grid distances for higher-order LBM boundary conditions in a GPU simulation environment
- Exploration of new limiter schemes for stress tensors in Lagrangian and ALE hydrocodes
- Immersed boundary conditions for hypersonic flows using ENO-like least-square reconstruction
- Computing the \(k\)-visibility region of a point in a polygon
- A polygonal approximation for general 4-contours corresponding to weakly simple curves
- Optimal area polygonization problems: exact solutions through geometric duality
- A sharp-interface immersed boundary method for moving objects in compressible viscous flows
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Zone theorem for arrangements in dimension three
- On the coupling of wall-model immersed boundary conditions and curvilinear body-fitted grids for the simulation of complex geometries
- Extensions of self-improving sorters
- QuickhullDisk: a faster convex hull algorithm for disks
- An immersed-boundary method for compressible viscous flows and its application in the gas-kinetic BGK scheme
- Global-local ROM for the solution of parabolic problems with highly concentrated moving sources
- Entropy solution at concave corners and ridges, and volume boundary layer tangential adaptivity
- A simple, faster method for kinetic proximity problems
- Quicker than Quickhull
- Cutting out polygon collections with a saw
- Accurate interface normal and curvature estimates on three-dimensional unstructured non-convex polyhedral meshes
- An immersed boundary method for compressible flows using local grid refinement
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- Geometric moment invariants
- Computing straight-line 3D grid drawings of graphs in linear volume
- Adaptive WENO methods based on radial basis function reconstruction
- A new interface tracking method: the polygonal area mapping method
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- Broken circuit complexes and hyperplane arrangements
- Plane graphs with parity constraints
- Elastoplastic phenomena in multibody impact dynamics
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- The Erdős--Nagy theorem and its ramifications
- Preferred directions for resolving the non-uniqueness of Delaunay triangulations
- Parallelization alternatives and their performance for the convex hull problem
- LES of bubble dynamics in wake flows
- Random generation of \(Q\)-convex sets
- An improved method for calculating the no-fit polygon
- From theoretical graphic objects to real free-form solids
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- A direct method for determining the lower convex hull of a finite point set in 3D
- The fluid dynamics of rolling wheels at low Reynolds number
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- An augmented Lagrangian technique combined with a mortar algorithm for modelling mechanical contact problems
- A new algorithm for contact detection between spherical particle and triangulated mesh boundary in discrete element method simulations
- Locating a single facility and a high-speed line
- Kinetic clustering of points on the line
- Algorithms for interactive Sprouts
- A succinct 3D visibility skeleton
- scientific article; zbMATH DE number 1001714 (Why is no real title available?)
- scientific article; zbMATH DE number 1800030 (Why is no real title available?)
- Shape-understanding system: A system of experts
- hp-boundary layer mesh sequences with applications to shell problems
- Slope limiting for vectors: A novel vector limiting algorithm
- On Reconfiguration of Disks in the Plane and Related Problems
- scientific article; zbMATH DE number 7499212 (Why is no real title available?)
- Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulation
- Efficient time integration of Maxwell's equations with generalized finite differences
- Geometric Computational Electrodynamics with Variational Integrators and Discrete Differential Forms
- Modeling of Ocean-atmosphere interaction phenomena during the breaking of modulated wave trains
- An adaptive finite element method for second-order plate theory
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- Some computational aspects of geodesic convex sets in a simple polygon
- A computational strategy for thermo-poroelastic structures with a time -- space interface coupling
- Generating All Triangulations of Plane Graphs (Extended Abstract)
- Numerical simulation of pyroclastic density currents using locally refined Cartesian grids
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A collocated finite volume embedding method for simulation of flow past stationary and moving body
- scientific article; zbMATH DE number 589497 (Why is no real title available?)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- THE LARGEST EMPTY ANNULUS PROBLEM
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- Analysis of single rock blocks for general failure modes under conservative and non-conservative forces
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Flip procedure in geometric approximation of multiple-component shapes -- application to multiple-inclusion detection
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Greedy and local search heuristics to build area-optimal polygons
This page was built for publication: Computational Geometry in C
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226067)
