Computational Geometry in C

DOI10.1017/CBO9780511804120zbMath0912.68201OpenAlexW4298410530MaRDI QIDQ4226067

Publication date: 19 January 1999

Full work available at URL: https://doi.org/10.1017/cbo9780511804120

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of programming languages (68N15) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Related Items (only showing first 100 items - show all)

The visibility graph of congruent discs is Hamiltonian ⋮ Shape-understanding system: A system of experts ⋮ An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) ⋮ A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ Slope limiting for vectors: A novel vector limiting algorithm ⋮ Locating a single facility and a high-speed line ⋮ Kinetic clustering of points on the line ⋮ From theoretical graphic objects to real free-form solids ⋮ Accurate interface normal and curvature estimates on three-dimensional unstructured non-convex polyhedral meshes ⋮ Efficient Time Integration of Maxwell's Equations with Generalized Finite Differences ⋮ Algorithms for interactive Sprouts ⋮ \(hp\)-boundary layer mesh sequences with applications to shell problems ⋮ An immersed boundary method for compressible flows using local grid refinement ⋮ Optimal area polygonization problems: exact solutions through geometric duality ⋮ On Reconfiguration of Disks in the Plane and Related Problems ⋮ A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums ⋮ Geometric moment invariants ⋮ On the suitability of the immersed boundary method for the simulation of high-Reynolds-number separated turbulent flows ⋮ Linearly interpolated FDH efficiency score for nonconvex frontiers ⋮ Geometric Computational Electrodynamics with Variational Integrators and Discrete Differential Forms ⋮ Computing straight-line 3D grid drawings of graphs in linear volume ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ Modeling of Ocean-atmosphere interaction phenomena during the breaking of modulated wave trains ⋮ Numerical simulation of pyroclastic density currents using locally refined Cartesian grids ⋮ A novel model of conforming Delaunay triangulation for sensor network configuration ⋮ 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 ⋮ \(\alpha\)-concave hull, a generalization of convex hull ⋮ Adaptive WENO methods based on radial basis function reconstruction ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Kinetic Euclidean minimum spanning tree in the plane ⋮ 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 ⋮ A collocated finite volume embedding method for simulation of flow past stationary and moving body ⋮ Computational method for phase space transport with applications to Lobe dynamics and rate of escape ⋮ 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 ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction ⋮ Energy efficient low-cost virtual backbone construction for optimal routing in wireless sensor networks ⋮ Unnamed Item ⋮ Bounds for point recolouring in geometric graphs ⋮ Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms ⋮ A new algorithm for computing the convex hull of a planar point set ⋮ Efficient generation of simple polygons for characterizing the shape of a set of points in the plane ⋮ An adaptive finite element method for second-order plate theory ⋮ Elastoplastic phenomena in multibody impact dynamics ⋮ Method of orienting curves for determining the convex hull of a finite set of points in the plane ⋮ Zone theorem for arrangements in dimension three ⋮ A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon ⋮ GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST ⋮ On the coupling of wall-model immersed boundary conditions and curvilinear body-fitted grids for the simulation of complex geometries ⋮ Data structures for halfplane proximity queries and incremental Voronoi diagrams ⋮ Hausdorff approximation of 3D convex polytopes ⋮ TURBINS: an immersed boundary, Navier-Stokes code for the simulation of gravity and turbidity currents interacting with complex topographies ⋮ Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon ⋮ An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation ⋮ An efficient algorithm for the calculation of sub-grid distances for higher-order LBM boundary conditions in a GPU simulation environment ⋮ The Erdős--Nagy theorem and its ramifications ⋮ Preferred directions for resolving the non-uniqueness of Delaunay triangulations ⋮ A computational strategy for thermo-poroelastic structures with a time-space interface coupling ⋮ Exploration of new limiter schemes for stress tensors in Lagrangian and ALE hydrocodes ⋮ Finite difference scheme for solving general 3D convection-diffusion equation ⋮ Optimizing a constrained convex polygonal annulus ⋮ Recent progress in exact geometric computation ⋮ Parallelization alternatives and their performance for the convex hull problem ⋮ Immersed boundary conditions for hypersonic flows using ENO-like least-square reconstruction ⋮ Generating All Triangulations of Plane Graphs (Extended Abstract) ⋮ LES of bubble dynamics in wake flows ⋮ Computing the \(k\)-visibility region of a point in a polygon ⋮ Cellwise conservative unsplit advection for the volume of fluid method ⋮ Extensions of self-improving sorters ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ HyPAM: A hybrid continuum-particle model for incompressible free-surface flows ⋮ A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D ⋮ An immersed-boundary method for compressible viscous flows and its application in the gas-kinetic BGK scheme ⋮ A sweep-line algorithm for spatial clustering ⋮ A SUCCINCT 3D VISIBILITY SKELETON ⋮ Global-local ROM for the solution of parabolic problems with highly concentrated moving sources ⋮ 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 ⋮ Entropy solution at concave corners and ridges, and volume boundary layer tangential adaptivity ⋮ 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 ⋮ Random generation of \(Q\)-convex sets ⋮ The fluid dynamics of rolling wheels at low Reynolds number ⋮ An improved method for calculating the no-fit polygon ⋮ A simple, faster method for kinetic proximity problems ⋮ Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulation ⋮ An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves ⋮ Linear time approximation of 3D convex polytopes ⋮ On computing the optimal bridge between two convex polygons. ⋮ Quicker than Quickhull ⋮ An alternating heuristic for medianoid and centroid problems in the plane ⋮ Cutting out polygon collections with a saw

This page was built for publication: Computational Geometry in C