Pages that link to "Item:Q3049855"

The following pages link to Algorithms for Reporting and Counting Geometric Intersections (Q3049855):

Displaying 50 items.

• Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions (Q280177) (← links)
• Networked control challenges in collaborative road freight transport (Q328163) (← links)
• Euclidean chains and their shortcuts (Q391221) (← links)
• Efficient algorithms for local ranking (Q436589) (← links)
• Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
• Multi-facility ordered median problems in directed networks (Q545449) (← links)
• Algorithms for marketing-mix optimization (Q547308) (← links)
• The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
• Computing simple circuits from a set of line segments (Q583232) (← links)
• A series of algorithmic results related to the iterated hairpin completion (Q606982) (← links)
• A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces (Q625206) (← links)
• Arrangements on parametric surfaces. I: General framework and infrastructure (Q626974) (← links)
• A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
• Guarding a set of line segments in the plane (Q630591) (← links)
• Convex partitions with 2-edge connected dual graphs (Q652620) (← links)
• On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
• An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object (Q688223) (← links)
• Topology and arrangement computation of semi-algebraic planar curves (Q735517) (← links)
• Computing a sweeping-plane in regular (``general'') position: A numerical and a symbolic solution (Q751863) (← links)
• An improved upper bound on the number of intersections between two rectangular paths (Q758223) (← links)
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form (Q789728) (← links)
• Minimum vertex distance between separable convex polygons (Q789904) (← links)
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614) (← links)
• Planar rectilinear shortest path computation using corridors (Q833714) (← links)
• Optimal algorithms for some polygon enclosure problems for VLSI layout analysis (Q864923) (← links)
• A hybrid exact method for a scheduling problem with a continuous resource and energy constraints (Q890001) (← links)
• Convex blocking and partial orders on the plane (Q902426) (← links)
• Partitioning arrangements of lines. II: Applications (Q921915) (← links)
• Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere (Q924069) (← links)
• Computing the arrangement of circles on a sphere, with applications in structural biology (Q924070) (← links)
• The unpredictable deviousness of models (Q959796) (← links)
• Capturing crossings: convex hulls of segment and plane intersections (Q963438) (← links)
• Topological sweep of the complete graph (Q1003474) (← links)
• Finding the \(\Theta \)-guarded region (Q1037785) (← links)
• Searching for equilibrium positions in a game of political competition with restrictions (Q1038350) (← links)
• Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
• A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form (Q1057499) (← links)
• On a circle placement problem (Q1062430) (← links)
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976) (← links)
• Computing convolutions by reciprocal search (Q1091816) (← links)
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109) (← links)
• The expected size of some graphs in computational geometry (Q1106021) (← links)
• Scanline algorithms on a grid (Q1111020) (← links)
• Space reduction and an extension for a hidden line elimination algorithm (Q1126253) (← links)
• Space and time optimal algorithms for a class of rectangle intersection problems (Q1148121) (← links)
• A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\). (Q1155863) (← links)
• Polygonal intersection searching (Q1165007) (← links)
• A tight upper bound for the number of intersections between two rectangulars paths (Q1182612) (← links)
• Line-segment intersection reporting in parallel (Q1193518) (← links)
• The furthest-site geodesic Voronoi diagram (Q1207795) (← links)