Pages that link to "Item:Q1158972"
From MaRDI portal
The following pages link to Maintenance of configurations in the plane (Q1158972):
Displaying 50 items.
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Computing the Fréchet distance with a retractable leash (Q312142) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- A discrete geometry approach for dominant point detection (Q609167) (← links)
- A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Perfect binary space partitions (Q676587) (← links)
- A new approach to the dynamic maintenance of maximal points in a plane (Q751238) (← links)
- Computing shortest transversals (Q757096) (← links)
- Fast detection of polyhedral intersection (Q759483) (← links)
- On the definition and computation of rectilinear convex hulls (Q802314) (← links)
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues (Q827322) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Compressing spatio-temporal trajectories (Q833705) (← links)
- Tangential cover for thick digital curves (Q834266) (← links)
- Dynamic coresets (Q834605) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064) (← links)
- Connecting colored point sets (Q868381) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- A faster algorithm for the maximum weighted tardiness problem (Q916393) (← links)
- Optimal simplification of polygonal chains for subpixel-accurate rendering (Q950399) (← links)
- Convex hull properties and algorithms (Q984371) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- The projection median of a set of points (Q1025289) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- A matching problem in the plane (Q1064790) (← links)
- A note on finding a maximum empty rectangle (Q1079570) (← links)
- The power of geometric duality (Q1082821) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
- An O(log n) time parallel algorithm for triangulating a set of points in the plane (Q1107999) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- Parallel computational geometry (Q1115600) (← links)
- An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
- Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
- Two general methods for dynamizing decomposable searching problems (Q1149778) (← links)
- General methods for 'all elements' and 'all pairs' problems (Q1151265) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- A new data structure for shortest path queries in a simple polygon (Q1178232) (← links)
- On the dynamic maintenance of maximal points in the plane (Q1183433) (← links)
- Off-line dynamic maintenance of the width of a planar point set (Q1190292) (← links)
