Pages that link to "Item:Q1099957"

The following pages link to Fractional cascading. I: A data structuring technique (Q1099957):

Displaying 50 items.

• A note on the \(\epsilon\)-indicator subset selection (Q391190) (← links)
• The maximum box problem for moving points in the plane (Q411213) (← links)
• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
• Towards optimal range medians (Q541663) (← links)
• Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
• Untangled monotonic chains and adaptive range search (Q553358) (← links)
• Linear space data structures for two types of range search (Q578916) (← links)
• Polygonal chain approximation: A query based approach (Q706723) (← links)
• Optimal external memory planar point enclosure (Q834582) (← links)
• Range queries on uncertain data (Q897858) (← links)
• Dynamic fractional cascading (Q908708) (← links)
• Visibility and intersection problems in plane geometry (Q910213) (← links)
• Hidden surface removal for rectangles (Q918209) (← links)
• Parallel algorithms for the segment dragging problem (Q918740) (← links)
• Dominance made simple (Q987777) (← links)
• Region-restricted clustering for geographic data mining (Q1000925) (← links)
• Homogeneous 2-hop broadcast in 2D (Q1037783) (← links)
• Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
• The shortest watchtower and related problems for polyhedral terrains (Q1114400) (← links)
• Making data structures persistent (Q1117690) (← links)
• Parallel computational geometry of rectangles (Q1187198) (← links)
• Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
• Line-segment intersection reporting in parallel (Q1193518) (← links)
• Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
• Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q1194332) (← links)
• Parallel fractional cascading on hypercube multiprocessors (Q1196294) (← links)
• Intersection queries in sets of disks (Q1196457) (← links)
• Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
• Point location in fat subdivisions (Q1209353) (← links)
• Geometric applications of posets (Q1276942) (← links)
• Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
• The range co-minima problem (Q1318757) (← links)
• Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
• New results on binary space partitions in the plane (Q1370930) (← links)
• Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
• Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
• Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
• Efficient geometric-based computation of the string subsequence kernel (Q1741246) (← links)
• Range-max queries on uncertain data (Q1745722) (← links)
• Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects (Q1860195) (← links)
• Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
• An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
• I/O-efficient dynamic planar point location (Q1882856) (← links)
• Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
• Sweep methods for parallel computational geometry (Q1907233) (← links)
• Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
• Vertical decompositions for triangles in 3-space (Q1907609) (← links)
• Improved algorithms for placing undesirable facilities (Q1941958) (← links)
• Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)