Pages that link to "Item:Q759483"

The following pages link to Fast detection of polyhedral intersection (Q759483):

Displaying 37 items.

• Computing hereditary convex structures (Q540446) (← links)
• Witness (Delaunay) graphs (Q551502) (← links)
• The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
• Bounded-degree polyhedronization of point sets (Q691768) (← links)
• Computing shortest transversals (Q757096) (← links)
• A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
• Minimum vertex distance between separable convex polygons (Q789904) (← links)
• Computational geometry in a curved world (Q911324) (← links)
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) (← links)
• Computing circular separability (Q1079817) (← links)
• Finding transversals for sets of simple geometric figures (Q1083215) (← links)
• On the detection of a common intersection of k convex subjects in the plane (Q1111021) (← links)
• The shortest watchtower and related problems for polyhedral terrains (Q1114400) (← links)
• Parallel computational geometry (Q1115600) (← links)
• Parallel construction of subdivision hierarchies (Q1124347) (← links)
• Detecting the intersection of convex objects in the plane (Q1183506) (← links)
• Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
• Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
• Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
• Storing the subdivision of a polyhedral surface (Q1820438) (← links)
• Polyhedral line transversals in space (Q1822999) (← links)
• Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
• Bounds on the size of tetrahedralizations (Q1906047) (← links)
• Sigma-local graphs (Q2266933) (← links)
• Strategies for polyhedral surface decomposition: an experimental study. (Q2482891) (← links)
• Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). (Q2482899) (← links)
• Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
• FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT (Q2875646) (← links)
• TEMPORAL COHERENCE IN BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION (Q3422190) (← links)
• (Q4488857) (← links)
• COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231) (← links)
• Approximate Polytope Membership Queries (Q4600697) (← links)
• (Q5009560) (← links)
• On intersection searching problems involving curved objects (Q5054760) (← links)
• On the complexity of approximating and illuminating three-dimensional convex polyhedra (Q5057423) (← links)
• An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)