Pages that link to "Item:Q4018399"

The following pages link to An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Q4018399):

Displaying 20 items.

• Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
• Computing hereditary convex structures (Q540446) (← links)
• Conservative interpolation between volume meshes by local Galerkin projection (Q643933) (← links)
• Conservative interpolation on unstructured polyhedral meshes: an extension of the supermesh approach to cell-centered finite-volume variables (Q660267) (← links)
• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
• Conservative remapping and region overlays by intersecting arbitrary polyhedra (Q1282428) (← links)
• Extremal polygon containment problems (Q1330463) (← links)
• Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
• Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
• Bounds on the size of tetrahedralizations (Q1906047) (← links)
• Solving the diffusion equation on a non-aligned mesh (Q2014880) (← links)
• On the planar two-center problem and circular hulls (Q2105328) (← links)
• Approximating points by a piecewise linear function (Q2375945) (← links)
• Maximum overlap and minimum convex hull of two convex polyhedra under translations (Q2483561) (← links)
• Polyhedral GPU Accelerated Shape from Silhouette (Q3628512) (← links)
• (Q4488857) (← links)
• (Q5009560) (← links)
• An Efficient Implementation of Mass Conserving Characteristic-Based Schemes in Two and Three Dimensions (Q5112542) (← links)
• Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions (Q5458872) (← links)
• Computing the maximum overlap of two convex polygons under translations (Q6487432) (← links)