scientific article; zbMATH DE number 1433426
From MaRDI portal
Publication:4947407
Recommendations
Cited in
(only showing first 100 items - show all)- On the minimum total length of interval systems expressing all intervals, and range-restricted queries
- Translational packing of arbitrary polytopes
- Multiscale cell-based coarsening for discontinuous problems
- Kinetic collision detection for convex fat objects
- A practical approximation algorithm for the LMS line estimator
- Shortest descending paths through given faces
- Efficiency for continuous facility location problems with attraction and repulsion
- Computing the update of the repeated median regression line in linear time
- Clamshell casting
- Practical multiagent rendezvous through modified circumcenter algorithms
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- Heuristics for container loading of furniture
- Robustness of k-gon Voronoi diagram construction
- Geometric algorithms and combinatorial optimization.
- Casting a polyhedron with directional uncertainty
- The weighted farthest color Voronoi diagram on trees and graphs.
- Approximation algorithms for terrain guarding.
- On the separability of stochastic geometric objects, with applications
- Computing a minimum-width square or rectangular annulus with outliers
- Incremental Voronoi diagrams
- Pachinko
- Mutual exclusion in MANETs using quorum agreements
- Optimal selection of local approximants in RBF-PU interpolation
- Minimizing the diameter of a spanning tree for imprecise points
- Higher order mobile coverage control with applications to clustering of discrete sets
- How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case
- Enhancing point symmetry-based distance for data clustering
- An elementary algorithm for digital arc segmentation
- Computing large planar regions in terrains, with an application to fracture surfaces
- Approximation algorithms for aligning points
- On the computational complexity of 2-interval pattern matching problems
- Approximating geometric bottleneck shortest paths
- Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints
- Energy minimizing mountain ascent
- I/O efficient dynamic data structures for longest prefix queries
- A computational learning theory of active object recognition under uncertainty
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Comparison of mixed and isoparametric boundary elements in time domain poroelasticity
- Finding the optimal shape of the leading-and-trailing car of a high-speed train using design-by-morphing
- Kinetic collision detection for balls
- A numerical study into element type and mesh resolution for crystal plasticity finite element modeling of explicit grain structures
- Error-correcting neural networks for semi-Lagrangian advection in the level-set method
- Acrophobic guard watchtower problem
- Multi-affine visible height correlation analysis for revealing rich structures of fractal time series
- Faster compression of patterns to rectangle rule lists
- Source-location privacy full protection in wireless sensor networks
- Fast neighbor search by using revised k-d tree
- INSIM-FT in three-dimensions with gravity
- A particle-based free surface detection method and its application to the surface tension effects simulation in smoothed particle hydrodynamics (SPH)
- Largest triangle inside a terrain
- Zone theorem for arrangements in dimension three
- Planar multi-patch domain parameterization for isogeometric analysis based on evolution of fat skeleton
- A bio-inspired B-spline offset feature for structural topology optimization
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- Location of weighted anti-ordered median straight lines with Euclidean distances
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
- Approximate range searching: The absolute model
- Regression based automatic face annotation for deformable model building
- QuickhullDisk: a faster convex hull algorithm for disks
- Distributed combinatorial maps for parallel mesh processing
- A hierarchical curve-based approach to the analysis of manifold data
- Leveraging access mode declarations in a model for memory consistency in heterogeneous systems
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- Empirical geodesic graphs and CAT(k) metrics for data analysis
- A mortar method based on NURBS for curved interfaces
- Dual weighted residual error estimation for the finite cell method
- A non-iterative algorithm for generalized pig games
- The most points connected-covering problem with two disks
- Synchronized sweep algorithms for scalable scheduling constraints
- A numerical algorithm for multidimensional modeling of scattered data points
- Isoperimetric enclosures
- An FPTAS for the parametric knapsack problem
- Integral points in rational polygons: a numerical semigroup approach
- Top-k term-proximity in succinct space
- On the arrangement of stochastic lines in \(\mathbb{R}^2\)
- Advanced programming techniques applied to CGAL's arrangement package
- Rotation and lighting invariant template matching
- Multiple point evaluation on combined tensor product supports
- Visualization of road geometries based on CADD design standards
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- On incremental rendering of silhouette maps of a polyhedral scene
- Minimum weight pseudo-triangulations
- Transforming pseudo-triangulations
- Prophet: a context-aware location privacy-preserving scheme in location sharing service
- Nearest-neighbor searching under uncertainty. I
- Mind the gap!
- A mathematical framework for modeling axon guidance
- Biased range trees
- An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
- Computing homotopic shortest paths efficiently
- Algorithms for optimal area triangulations of a convex polygon
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time
- A note on minimum-sum coverage by aligned disks
- On reporting the \(L_1\) metric closest pair in a query rectangle
- Extracting constrained 2-interval subsets in 2-interval sets
- The generic Gröbner walk
- A tight lower bound for computing the diameter of a 3D convex polytope
- On local transformations in plane geometric graphs embedded on small grids
- Query point visibility computation in polygons with holes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4947407)
