Pages that link to "Item:Q3711764"
From MaRDI portal
The following pages link to Primitives for the manipulation of general subdivisions and the computation of Voronoi (Q3711764):
Displaying 50 items.
- Using bigraphs to model topological graphs embedded in orientable surfaces (Q383361) (← links)
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Fast point and element search method in adaptive remeshing procedure and its applications (Q420199) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- On converting sets of tetrahedra to combinatorial and PL manifolds (Q625237) (← links)
- Arrangements on parametric surfaces. II: Concretizations and applications (Q626976) (← links)
- Topological mesh operators (Q630999) (← links)
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- Filling gaps in the boundary of a polyhedron (Q673983) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- A data modeling abstraction for describing triangular mesh algorithms (Q678220) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (Q706993) (← links)
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- Construction of Voronoi diagrams in the plane by using maps (Q751861) (← links)
- Bisectors of linearly separable sets (Q753504) (← links)
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- Order-k Voronoi diagrams of sites with additive weights in the plane (Q802900) (← links)
- Merging in maps and in pavings (Q809631) (← links)
- HCPO: an efficient insertion order for incremental Delaunay triangulation (Q834986) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- A new representation of orientable 2-manifold polygonal surfaces for geometric modelling (Q863841) (← links)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
- A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Tight bounds for connecting sites across barriers (Q958235) (← links)
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- Coupled fluid-structure solver: the case of shock wave impact on monolithic and composite material plates (Q1028248) (← links)
- The power of geometric duality (Q1082821) (← links)
- Computing convolutions by reciprocal search (Q1091816) (← links)
- Polygonizations of point sets in the plane (Q1093906) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- The complexity of cutting complexes (Q1115186) (← links)
- Primitives for the manipulation of three-dimensional subdivisions (Q1115576) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Verifiable implementations of geometric algorithms using finite precision arithmetic (Q1116270) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
- Delaunay triangulation of arbitrarily shaped planar domains (Q1183535) (← links)
- Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
- Computing bushy and thin triangulations (Q1190294) (← links)
- Delaunay triangulations in three dimensions with finite precision arithmetic (Q1195754) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
