scientific article; zbMATH DE number 5253533
From MaRDI portal
Publication:5452284
zbMath1140.68069MaRDI QIDQ5452284
Marc J. van Kreveld, Mark H. Overmars, Mark T. de Berg, Otfried Schwarzkopf
Publication date: 25 March 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Simplifying Non-Simple Fan-Planar Drawings, Tracking Paths, Uniformity of Point Samples in Metric Spaces Using Gap Ratio, FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES, Unnamed Item, Adaptive Point Location in Planar Convex Subdivisions, Peeling Potatoes Near-Optimally in Near-Linear Time, Fast floating-point filters for robust predicates, Maximum matchings in geometric intersection graphs, Kinetic Geodesic Voronoi Diagrams in a Simple Polygon, An effective similarity measurement under epistemic uncertainty, FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions, Sequence to graph alignment using gap-sensitive co-linear chaining, Differentially fixed ideals in affine semigroup rings, A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems, On reverse shortest paths in geometric proximity graphs, An algorithmic framework for the single source shortest path problem with applications to disk graphs, Clique-based separators for geometric intersection graphs, Complexity and approximation for discriminating and identifying code problems in geometric setups, Range updates and range sum queries on multidimensional points with monoid weights, Sensitivity analysis and tailored design of minimization diagrams, Dynamic convex hulls under window-sliding updates, Efficient folding algorithms for convex polyhedra, Dynamic connectivity in disk graphs, Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions, Monochromatic partitioning of colored points by lines, Shock capturing using discontinuous Galerkin method and overset grids for two-dimensional Euler equations, Mesh generation for thin layered domains and its application to parallel multigrid simulation of groundwater flow, Rectangularization of digital objects and its relation with straight skeletons, Optimal window queries on line segments using the trapezoidal search DAG, Algorithms for \(k\)-dispersion for points in convex position in the plane, Arbitrary-oriented color spanning region for line segments, Faster algorithms for largest empty rectangles and boxes, Market areas in general equilibrium, Network augmentation for disaster‐resilience against geographically correlated failure, Point enclosure problem for homothetic polygons, Fast multipole methods for the evaluation of layer potentials with locally-corrected quadratures, A positive fraction Erdős-Szekeres theorem and its applications, Topology-driven goodness-of-fit tests in arbitrary dimensions, Online Spanners in Metric Spaces, Unnamed Item, Unnamed Item, Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees, Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications, A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes, The Most Likely Object to be Seen Through a Window, Shortest rectilinear path queries to rectangles in a rectangular domain, Range closest-pair search in higher dimensions, Reachability problems for transmission graphs, Algorithms for the line-constrained disk coverage and related problems, Approximating the Packedness of Polygonal Curves, Discriminating Codes in Geometric Setups, Discovering distorted repeating patterns in polyphonic music through longest increasing subsequences, Optimizing active ranges for consistent dynamic map labeling, Place the Vertices Anywhere on the Curve and Simplify, Reachability problems for transmission graphs, Algorithms for the line-constrained disk coverage and related problems, A Parallel Approach to the Variational Transfer of Discrete Fields between Arbitrarily Distributed Unstructured Finite Element Meshes, Minimum-width annulus with outliers: circular, square, and rectangular cases, Convexity-increasing morphs of planar graphs, Gathering in the plane of location-aware robots in the presence of spies, A fast implementation for the 2D/3D box placement problem, Maximum-width empty square and rectangular annulus, On the computability of rotation sets and their entropies, Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks, Minimum reload cost graph factors, Mathematical characterizations and computational complexity of anti-slide puzzles, Intersecting disks using two congruent disks, Mathematical characterizations and computational complexity of anti-slide puzzles, Intersecting disks using two congruent disks, Minimizing the Maximum Moving Cost of Interval Coverage, Close-to-optimal algorithm for rectangular decomposition of 3D shapes, Maximizing dominance in the plane and its applications, Grid peeling and the affine curve-shortening flow, Geometry and Generation of a New Graph Planarity Game, Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces, Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points, Partial Enclosure Range Searching, Unnamed Item, Unnamed Item, Unnamed Item, Efficient Algorithms to Test Digital Convexity, Unnamed Item, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane, Approximating Minimization Diagrams and Generalized Proximity Search, Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time, Unnamed Item, Unnamed Item, Unnamed Item, Optimal Algorithms for Geometric Centers and Depth, Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions, Calculation of Discrepancy Measures and Applications, An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets, Evaluation of Labeling Strategies for Rotating Maps, Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points., Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces, Dynamic Conflict-Free Colorings in the Plane, Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended, Near optimal subdivision algorithms for real root isolation, Approximation algorithms on consistent dynamic map labeling, Straight-path queries in trajectory data, Rearranging a sequence of points onto a line, Routing among convex polygonal obstacles in the plane, Aspect ratio universal rectangular layouts, The polygon burning problem, Shortest paths among transient obstacles, Memory-constrained algorithms for simple polygons, On some geometric problems of color-spanning sets, Optimal point-set embedding of wheel graphs and a sub-class of 3-trees, Arboral satisfaction: recognition and LP approximation, Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals, Use of simple polygonal chains in generating random simple polygons, Computing conforming partitions of orthogonal polygons with minimum stabbing number, Co-linear chaining with overlaps and gap costs, Bipartite diameter and other measures under translation, K-dominance in multidimensional data: theory and applications, Imposing minimum length scale in moving morphable component (MMC)-based topology optimization using an effective connection status (ECS) control method, A polytree based coupling method for non-matching meshes in 3D, Finding pairwise intersections of rectangles in a query rectangle, Convex hulls under uncertainty, Sequential pursuit of multiple targets under external disturbances via Zermelo-Voronoi diagrams, Single facility siting involving allocation decisions, Line segment covering of cells in arrangements, MAP123: a data-driven approach to use 1D data for 3D nonlinear elastic materials modeling, Efficient independent set approximation in unit disk graphs, Earth pressure field modeling for tunnel face stability evaluation of EPB shield machines based on optimization solution, Region-based approximation of probability distributions (for visibility between imprecise points among obstacles), A new balanced subdivision of a simple polygon for time-space trade-off algorithms, The homogeneous broadcast problem in narrow and wide strips. I: Algorithms, Tracking paths, Improved bounds on absolute positiveness of multivariate polynomials, Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location, Dynamic data structures for interval coloring, Near-linear approximation algorithms for geometric hitting sets, Reachable region query and its applications, Variations of largest rectangle recognition amidst a bichromatic point set, On colouring point visibility graphs, Efficiently testing digital convexity and recognizing digital convex polygons, On 2-site Voronoi diagrams under geometric distance functions, Gathering by repulsion, Approximate range closest-pair queries, Maximizing ink in partial edge drawings of \(k\)-plane graphs, Wave propagation in fractured-porous media with different percolation length of fracture systems, Eliminating depth cycles among triangles in three dimensions, Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications, On the fast delivery problem with one or two packages, An analysis of the sensitivity and stability of patients' preferences can lead to more appropriate medical decisions, The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition, Multi-region Delaunay complex segmentation, On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface, A note on searching line arrangements and applications, Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities, Using the discrete element method to simulate brittle fracture in the indentation of a silica glass with a blunt indenter, Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions, Delta Voronoi smoothed particle hydrodynamics, \(\delta\)-VSPH, Dynamic geometric data structures via shallow cuttings, Counting the number of crossings in geometric graphs, STL*: extending signal temporal logic with signal-value freezing operator, Removing depth-order cycles among triangles: an algorithm generating triangular fragments, Displacement energy of unit disk cotangent bundles, Faster multi-sided one-bend boundary labelling, Window queries for intersecting objects, maximal points and approximations using coresets, A space exploration algorithm for multiparametric programming via Delaunay triangulation, Quickest path queries on transportation network, Computing homotopic line simplification, A fully general, exact algorithm for nesting irregular shapes, A general 3D contact smoothing method based on radial point interpolation, Range search on tuples of points, Linear-space data structures for range mode query in arrays, The multicriteria \(p\)-facility median location problem on networks, The Euclidean bottleneck full Steiner tree problem, Computing the visibility map of fat objects, Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions, Visibility extension via mirror-edges to cover invisible segments, Approximating a planar convex set using a sparse grid, Three-dimensional crack propagation with distance-based discontinuous kernels in meshfree methods, Near-linear algorithms for geometric hitting sets and set covers, Minimum perimeter-sum partitions in the plane, Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem, The most-likely skyline problem for stochastic points, On the shortest separating cycle, Minimum length scale control in structural topology optimization based on the moving morphable components (MMC) approach, Identification and quantification of multivariate interval uncertainty in finite element models, Reachability oracles for directed transmission graphs, Quickest visibility queries in polygonal domains, Calculus of fuzzy vector-valued functions and almost periodic fuzzy vector-valued functions on time scales, Faster algorithms for growing prioritized disks and rectangles, Delaunay simplices in diagonally distorted lattices, Closest-pair queries in fat rectangles, Some results on point visibility graphs, On a class of covering problems with variable capacities in wireless networks, Fixed-parameter complexity and approximability of norm maximization, Monitoring the plane with rotating radars, Computing Klee's measure of grounded boxes, Optimizing airspace closure with respect to politicians' egos, Computing maximum non-crossing matching in convex bipartite graphs, Weak visibility queries of line segments in simple polygons, Four-connected triangulations of planar point sets, Efficient operations on discrete paths, Improved algorithms for the bichromatic two-center problem for pairs of points, Closest-pair queries and minimum-weight queries are equivalent for squares, Between shapes, using the Hausdorff distance, A connectivity graph generation approach for Manhattan path calculation in detailed facility layout, On the geometric structures with \(n\) points and \(k\) distances, Minimum cuts in geometric intersection graphs, On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\), A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes, Finding a largest-area triangle in a terrain in near-linear time, Algorithms for graphs of bounded treewidth via orthogonal range searching, Counting carambolas, Parallel finite element technique using Gaussian belief propagation, On the representation of the search region in multi-objective optimization, From proximity to utility: a Voronoi partition of Pareto optima, An isogeometric design-through-analysis methodology based on adaptive hierarchical refinement of NURBS, immersed boundary methods, and T-spline CAD surfaces, Optimal randomized incremental construction for guaranteed logarithmic planar point location, Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results, Fitting a Sobolev function to data. III, Connecting the dots: semi-analytical and random walk numerical solutions of the diffusion-reaction equation with stochastic initial conditions, On inducing polygons and related problems, (Approximate) uncertain skylines, Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve, External-memory multimaps, Exploring or reducing noise? A global optimization algorithm in the presence of noise, A regularization approach for estimating the type of a plane curve singularity, The multi-facility median problem with Pos/Neg weights on general graphs, Exact algorithms and APX-hardness results for geometric packing and covering problems, Closest pair and the post office problem for stochastic points, Reprint of: Memory-constrained algorithms for simple polygons, Fast query structures in anisotropic media, On an extension of the Sort \& Search method with application to scheduling theory, A note on coloring line arrangements, On the stretch factor of Delaunay triangulations of points in convex position, A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space, Strong connectivity of sensor networks with double antennae, Range queries on uncertain data, Approximation algorithms for free-label maximization, Reasoning about visibility, Bundling three convex polygons to minimize area or perimeter, Bottleneck partial-matching Voronoi diagrams and applications, Separating bichromatic point sets by L-shapes, Approximating the bottleneck plane perfect matching of a point set, Farthest-polygon Voronoi diagrams, Efficient retrieval of approximate palindromes in a run-length encoded string, Ramified rectilinear polygons: coordinatization by dendrons, Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions, Applying abstract acceleration to (co-)reachability analysis of reactive programs, Efficient algorithms for local ranking, Designing and proving correct a convex hull algorithm with hypermaps in Coq, Preprocessing imprecise points for Delaunay triangulation: simplified and extended, Selecting radiotherapy dose distributions by means of constrained optimization problems, Discontinuous Galerkin methods with nodal and hybrid modal/nodal triangular, quadrilateral, and polygonal elements for nonlinear shallow water flow, Connectivity guarantees for wireless networks with directional antennas, A survey of geodesic paths on 3D surfaces, Accurate fluid-structure interaction computations using elements without mid-side nodes, On the least trimmed squares estimator, Balanced partitions of 3-colored geometric sets in the plane, A class of piecewise interpolating functions based on barycentric coordinates, Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\), Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Qualitative constraint satisfaction problems: an extended framework with landmarks, Leader election and gathering for asynchronous fat robots without common chirality, Path planning with divergence-based distance functions, On finding a shortest isothetic path and its monotonicity inside a digital object, Group nearest-neighbor queries in the \(L_1\) plane, Efficient algorithms for the one-dimensional \(k\)-center problem, Quell, Secure multiparty computation of solid geometric problems and their applications, Recognition and complexity of point visibility graphs, Opaque sets, Estimation of effective diffusion coefficients of drug delivery devices in a flow-through system, Top-\(k\) Manhattan spatial skyline queries, Computing the coarseness with strips or boxes, Data imprecision under \(\lambda\)-geometry model, Variational implementation of immersed finite element methods, Approximating a real number by a rational number with a limited denominator: a geometric approach, Binary plane partitions for disjoint line segments, Kinetic spanners in \(\mathbb R^{d}\), Computing hereditary convex structures, Witness (Delaunay) graphs, Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle, Scheduling tasks with exponential duration on unrelated parallel machines, Improved local algorithms for spanner construction, Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs, A new fast heuristic for labeling points, A general approach for cache-oblivious range reporting and approximate range counting, The partial visibility representation extension problem, Monotone paths in geometric triangulations, Diffusion-controlled reactions modeling in Geant4-DNA, Region-restricted clustering for geographic data mining, Efficient \(c\)-oriented range searching with DOP-trees, Vertex-colored encompassing graphs, A fast algorithm for data collection along a fixed track, RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point, Region-fault tolerant geometric spanners, The minimum speed for a blocking problem on the half plane, Empty pseudo-triangles in point sets, A Nitsche stabilized finite element method for embedded interfaces: application to fluid-structure interaction and rigid-body contact, Grid refinement in the construction of Lyapunov functions using radial basis functions, Motion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search, Batched Point Location in SINR Diagrams via Algebraic Tools, Finding Pairwise Intersections Inside a Query Range, Convex Polygons in Geometric Triangulations, Time-Space Trade-offs for Triangulations and Voronoi Diagrams, PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS, A Computational and Theoretical Investigation of the Accuracy of Quasicontinuum Methods, Reconstruction of Weakly Simple Polygons from Their Edges, Bounded-degree factors of lacunary multivariate polynomials, Novel geometric approach for virtual coiling, On the Power of the Semi-Separated Pair Decomposition, Delaunay Triangulation of Imprecise Points Simplified and Extended, Computing the Implicit Voronoi Diagram in Triple Precision, An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization, Unnamed Item, Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs, A Shape-Newton Approach to the Problem of Covering with Identical Balls, Towards an Optimal Method for Dynamic Planar Point Location, Triangulability of convex graphs and convex skewness, The Euclidean \(k\)-supplier problem in \(I R^2\), Knotted portals in virtual reality, A reformulation-linearization based algorithm for the smallest enclosing circle problem, 3D Rectangulations and Geometric Matrix Multiplication, Spanners for Directed Transmission Graphs, New bounds for range closest-pair problems, Kinetic Reverse k-Nearest Neighbor Problem, Uniformity of Point Samples in Metric Spaces Using Gap Ratio, Skew Jensen-Bregman Voronoi Diagrams, Guarding a Polygon Without Losing Touch, A discontinuous Galerkin overset scheme using WENO reconstruction and subcells for two-dimensional problems, Area Optimal Polygonization Using Simulated Annealing, On path-greedy geometric spanners, Time and space efficient collinearity indexing, Packing convex polygons in minimum-perimeter convex hulls, NURBS Enhanced Virtual Element Methods for the Spatial Discretization of the Multigroup Neutron Diffusion Equation on Curvilinear Polygonal Meshes, Geometric Packing under Nonuniform Constraints, An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3, Unnamed Item, Approximate Polytope Membership Queries, Boolean algebra of two-dimensional continua with arbitrarily complex topology, Approximate $k$-Nearest Neighbor Graph on Moving Points, Approximation of the Willmore energy by a discrete geometry model, Simplex Range Searching and Its Variants: A Review, Constant-Factor Approximation for TSP with Disks, Unnamed Item, Modified refinement algorithm to construct Lyapunov functions using meshless collocation, Lagrangian Transport through Surfaces in Compressible Flows, PERFORMANCE OF DIFFERENT INTEGRATION SCHEMES IN FACING DISCONTINUITIES IN THE FINITE CELL METHOD, Emanation graph: a plane geometric spanner with Steiner points, Empty squares in arbitrary orientation among points, Bundling Two Simple Polygons to Minimize Their Convex Hull, A two-phase method for solving continuous rank-one quadratic knapsack problems, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, Covering Polygons with Rectangles, Disordered contact networks in jammed packings of frictionless disks, On Some Geometric Problems of Color-Spanning Sets, Towards Min Max Generalization in Reinforcement Learning, Discrete unit square cover problem, Fault-Tolerant Compact Routing Schemes for General Graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Shortest Gently Descending Paths, Placing Text Boxes on Graphs, Computing the Distance between Piecewise-Linear Bivariate Functions, Unnamed Item, Unnamed Item, Point Visibility Graph Recognition is NP-Hard, Multi Cover of a Polygon Minimizing the Sum of Areas, Unnamed Item, Quadtrees as an Abstract Domain, Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs, Data Structures for Higher-Dimensional Rectilinear Packing, Minimum Width Color Spanning Annulus, ReLU Networks Are Universal Approximators via Piecewise Linear or Constant Functions, Resolving SINR Queries in a Dynamic Setting, Process capability vector for multivariate nonlinear profiles, Preprocessing Ambiguous Imprecise Points, Point Location in Incremental Planar Subdivisions., Convex partial transversals of planar regions, Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model, Linear programming over exponent pairs, Unnamed Item, Hierarchical Design of Fast Minimum Disagreement Algorithms, The Dominating Set Problem in Geometric Intersection Graphs, K-Dominance in Multidimensional Data: Theory and Applications, Dynamic smooth compressed quadtrees, Boundary Labeling for Rectangular Diagrams, Approximate Range Queries for Clustering, Time Windowed Data Structures for Graphs, Efficient maximum matching algorithms for trapezoid graphs, ENCRYPTION OF 3D PLANE IN GIS USING VORONOI-DELAUNAY TRIANGULATIONS AND CATALAN NUMBERS, Mitered Offsets and Skeletons for Circular Arc Polygons, Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem, One-sided terrain guarding and chordal graphs, Two optimization problems for unit disks, Time-space trade-offs for triangulations and Voronoi diagrams, Exact Minkowski sums of polygons with holes, Bumpy pyramid folding, Amortized analysis of smooth quadtrees in all dimensions, Minimum-link shortest paths for polygons amidst rectilinear obstacles, Kinetic \(k\)-semi-Yao graph and its applications, The minimum convex container of two convex polytopes under translations, Efficient searching in meshfree methods, Local routing in sparse and lightweight geometric graphs, General, robust, and efficient polyhedron intersection in the interface reconstruction library, Dynamic conflict-free colorings in the plane, On dominating set of some subclasses of string graphs, 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, Kinetic Euclidean minimum spanning tree in the plane, 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, On the power of the semi-separated pair decomposition, 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, Algorithmic aspects of proportional symbol maps, 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, Generating star-shaped blocks for scaled boundary multipatch IGA, Efficient geometric-based computation of the string subsequence kernel, Routing in unit disk graphs, Geometric hitting set for segments of few orientations, Coloring Delaunay-edges and their generalizations, On separating points by lines, Equivalent Legendre polynomials: numerical integration of discontinuous functions in the finite element methods, Almost tight bounds for eliminating depth cycles in three dimensions, Minimum width color spanning annulus, Planar maximum-box problem revisited, A quick negative selection algorithm for one-class classification in big data era, Computing equilibria in dynamic models with occasionally binding constraints, Finding pairwise intersections inside a query range, 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, Motion planning via manifold samples, On the restricted 1-Steiner tree problem, Fractal and complex network analyses of protein molecular dynamics, Balanced splitting on weighted intervals, 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, The projections of convex lattice sets of points in \(\mathbb{E}^2\), 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\), 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, 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, Decompositions and boundary coverings of non-convex fat polyhedra, An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem, 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
