scientific article; zbMATH DE number 3918300
From MaRDI portal
Publication:3693476
Cited in
(19)- Decomposition and intersection of simple splinegons
- Detecting the intersection of convex objects in the plane
- On computing the optimal bridge between two convex polygons.
- Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases
- Efficient visibility queries in simple polygons
- Computational geometry in location
- Automatic generation of transitional meshes.
- All-hexahedral mesh smoothing with a node-based measure of quality
- Computing the optimal bridge between two convex polygons
- scientific article; zbMATH DE number 4211464 (Why is no real title available?)
- scientific article; zbMATH DE number 4170139 (Why is no real title available?)
- scientific article; zbMATH DE number 1221432 (Why is no real title available?)
- scientific article; zbMATH DE number 1004906 (Why is no real title available?)
- OCTREE-BASED HEXAHEDRAL MESH GENERATION
- scientific article; zbMATH DE number 1416569 (Why is no real title available?)
- scientific article; zbMATH DE number 223675 (Why is no real title available?)
- Computational line geometry
- scientific article; zbMATH DE number 7765386 (Why is no real title available?)
- Computational Line Geometry
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3693476)