Pages that link to "Item:Q1068550"

The following pages link to The power of geometric duality revisited (Q1068550):

Displaying 33 items.

• The \(k\)-centrum straight-line location problem (Q655169) (← links)
• Geometric Knapsack problems (Q689105) (← links)
• On a triangle counting problem (Q909463) (← links)
• Improved algorithm for the widest empty 1-corner corridor (Q989575) (← links)
• A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
• An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
• Counting convex \(k\)-gons in planar point sets (Q1190511) (← links)
• Geometric applications of posets (Q1276942) (← links)
• Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
• Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. (Q1395576) (← links)
• Continuous location of dimensional structures. (Q1410321) (← links)
• An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
• Point set pattern matching in \(d\)-dimensions (Q1891233) (← links)
• A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
• Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) (Q2135626) (← links)
• Location of weighted anti-ordered median straight lines with Euclidean distances (Q2255051) (← links)
• Locating a median line with partial coverage distance (Q2349526) (← links)
• Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
• Computing closest and farthest points for a query segment (Q2481974) (← links)
• Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
• Locating an obnoxious plane (Q2496077) (← links)
• Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
• Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
• Algorithms for Colourful Simplicial Depth and Medians in the Plane (Q2958332) (← links)
• MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK (Q3016229) (← links)
• Improved Algorithm for a Widest 1-Corner Corridor (Q3605487) (← links)
• Reporting the crossing-free segments of a complete geometric graph (Q4332449) (← links)
• THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS (Q4650088) (← links)
• Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
• The two-line center problem from a polar view: a new algorithm and data structure (Q5057418) (← links)
• Geometric Applications of Posets (Q5096956) (← links)
• Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)