Pages that link to "Item:Q1253450"
From MaRDI portal
The following pages link to Finding the intersection of two convex polyhedra (Q1253450):
Displayed 34 items.
- Linear space data structures for two types of range search (Q578916) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- Minimum vertex distance between separable convex polygons (Q789904) (← links)
- An n log n algorithm for determining the congruity of polyhedra (Q798003) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Finding Hamiltonian cycles in certain planar graphs (Q916416) (← links)
- On a circle placement problem (Q1062430) (← links)
- The power of geometric duality (Q1082821) (← links)
- Reconstructing visible regions from visible segments (Q1090463) (← links)
- Polygonizations of point sets in the plane (Q1093906) (← links)
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Hidden-surface removal in polyhedral cross-sections (Q1104083) (← links)
- Establishing order in planar subdivisions (Q1115185) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Finding the intersection of n half-spaces in time O(n log n) (Q1260355) (← links)
- Geometrical tools in classification (Q1350810) (← links)
- Representing geometric structures in \(d\) dimensions: Topology and order (Q1802222) (← links)
- Generating rooted triangulations without repetitions (Q1817003) (← links)
- Storing the subdivision of a polyhedral surface (Q1820438) (← links)
- Reporting and counting segment intersections (Q1821557) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon (Q1924710) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- On certain Hamiltonian inner triangulations (Q2367404) (← links)
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS (Q4676179) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE (Q4818563) (← links)