Computational geometry. Algorithms and applications.
From MaRDI portal
(Redirected from Publication:5452284)
Cited in
(only showing first 100 items - show all)- Region-restricted clustering for geographic data mining
- Efficient \(c\)-oriented range searching with DOP-trees
- Region-fault tolerant geometric spanners
- The minimum speed for a blocking problem on the half plane
- Decompositions and boundary coverings of non-convex fat polyhedra
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Geometric algorithms and combinatorial optimization.
- Two optimization problems for unit disks
- Time-space trade-offs for triangulations and Voronoi diagrams
- Bumpy pyramid folding
- Amortized analysis of smooth quadtrees in all dimensions
- Kinetic \(k\)-semi-Yao graph and its applications
- The minimum convex container of two convex polytopes under translations
- Efficient searching in meshfree methods
- Dynamic conflict-free colorings in the plane
- Lagrangian numerical methods for ocean biogeochemical simulations
- A discontinuous Galerkin Chimera scheme
- The lion and man game on polyhedral surfaces with obstacles
- A discontinuous Galerkin scheme for Chimera overset viscous meshes on curved geometries
- Higher-order adaptive finite difference methods for fully nonlinear elliptic equations
- Survey of quantitative methods in construction
- A box decomposition algorithm to compute the hypervolume indicator
- The range 1 query (R1Q) problem
- Computation of the metric average of 2D sets with piecewise linear boundaries
- Recognizing weakly simple polygons
- Untangling planar curves
- Hamiltonian tetrahedralizations with Steiner points
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra
- Characterizing regions of attraction for piecewise affine systems by continuity of discrete transition functions
- Routing in a polygonal terrain with the shortest beacon watchtower
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\)
- 3D rectangulations and geometric matrix multiplication
- Hierarchical design of fast minimum disagreement algorithms
- On the computation of zone and double zone diagrams
- A new three-dimensional topology optimization method based on moving morphable components (MMCs)
- Spanners for geodesic graphs and visibility graphs
- Computational complexity aspects of point visibility graphs
- k-balanced center location problem: a new multi-objective facility location problem
- Geometrical aggregation of finite fuzzy sets
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- The complexity of dominating set in geometric intersection graphs
- Efficient geometric-based computation of the string subsequence kernel
- Minimum width color spanning annulus
- Planar maximum-box problem revisited
- Finding pairwise intersections inside a query range
- Fractal and complex network analyses of protein molecular dynamics
- Balanced splitting on weighted intervals
- The projections of convex lattice sets of points in \(\mathbb{E}^2\)
- An exact geometry-based algorithm for path planning
- On the numerical integration of trimmed isogeometric elements
- Isogeometric numerical dispersion analysis for two-dimensional elastic wave propagation
- Kinetic Euclidean minimum spanning tree in the plane
- On the power of the semi-separated pair decomposition
- Algorithmic aspects of proportional symbol maps
- Generating star-shaped blocks for scaled boundary multipatch IGA
- Coloring Delaunay-edges and their generalizations
- On separating points by lines
- Equivalent Legendre polynomials: numerical integration of discontinuous functions in the finite element methods
- A quick negative selection algorithm for one-class classification in big data era
- Computing equilibria in dynamic models with occasionally binding constraints
- Multiple filterbanks for image processing: implementation issues
- Color-spanning localized query
- Continuation of point clouds via persistence diagrams
- Computing optimal shortcuts for networks
- Kolmogorov-Smirnov test for spatially correlated data
- Volumetric untrimming: precise decomposition of trimmed trivariates into tensor products
- On the restricted 1-Steiner tree problem
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Computing the \(k\)-visibility region of a point in a polygon
- Rainbow polygons for colored point sets in the plane
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- A new variational approach based on level-set function for convex hull problem with outliers
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
- Nonuniform SINR+Voronoi diagrams are effectively uniform
- Voronoi game on polygons
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Optimizing generalized kernels of polygons
- A fast shortest path algorithm on terrain-like graphs
- An improved FPT algorithm for the flip distance problem
- Intersection joins under updates
- A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains
- Piecewise linear approximation by the method of worst segment division
- Local geometric spanners
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- 1-line minimum rectilinear Steiner trees and related problems
- On the restricted k-Steiner tree problem
- Triangulation algorithms for generating as-is floor plans
- Approximating the packedness of polygonal curves
- Emerging spanning trees in the work of Candilis-Josic-Woods
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Tropical bisectors and Voronoi diagrams
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- The maximum-level vertex in an arrangement of lines
- Adaptive succinctness
- Computing Shapley values in the plane
- Minimum-link shortest paths for polygons amidst rectilinear obstacles
- Local routing in sparse and lightweight geometric graphs
- General, robust, and efficient polyhedron intersection in the interface reconstruction library
- On dominating set of some subclasses of string graphs
This page was built for publication: Computational geometry. Algorithms and applications.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452284)
