conquer3d 0.7.3__tar.gz → 0.7.4__tar.gz

{conquer3d-0.7.3/conquer3d.egg-info → conquer3d-0.7.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: conquer3d
-Version: 0.7.3
+Version: 0.7.4
 Summary: Geometric Cuda Tool Box
 Author-email: Do Hoang Khoi <khoido8899@gmail.com>
 License-Expression: MIT
@@ -60,9 +60,16 @@ Dynamic: license-file
 
 ---
 
+> [!NOTE]
+> The API documentation and the [documentation website](https://khoidoo.github.io/conquer3d/)
+> were written with [Claude](https://claude.ai/code). The library itself — every CUDA kernel,
+> data structure and operator — is the author's own work.
+
+---
+
 ## 🌟 Overview
 
-**Conquer3D** is an ultra-fast, GPU-native computational geometry and differentiable spatial computing library engineered in **PyTorch and CUDA**. Designed from the ground up for 3D computer vision, generative AI, neural surface reconstruction, and differentiable rendering, **Conquer3D** delivers up to **~1.0 Billion faces/second** isosurface extraction, exact CAD sharp crease preservation, and memory-efficient spatial acceleration structures.
+**Conquer3D** is an ultra-fast, GPU-native computational geometry and differentiable spatial computing library engineered in **PyTorch and CUDA**. Designed from the ground up for 3D computer vision, generative AI, neural surface reconstruction, and differentiable rendering, **Conquer3D** delivers up to **~1.3 Billion faces/second** isosurface extraction, exact CAD sharp crease preservation, and memory-efficient spatial acceleration structures.
 
 Every operator consumes and produces PyTorch tensors **in place** — no host round-trip, no format conversion — so meshing a field is an operation *inside* a training step rather than a preprocessing stage around it.
 
@@ -115,14 +122,18 @@ The API reference does not stop at the Python surface. It descends through the p
 
 ## ⚡ Benchmarks
 
-*Empirical extraction performance on **NVIDIA GeForce RTX 4090** on the **Fandisk CAD model** at **$1024^3$ resolution** (6.86M sparse vertices, 5.15M active voxels):*
+*Measured on **NVIDIA GeForce RTX 4090** (torch 2.8.0+cu128, CUDA 12.8) on the **Fandisk CAD model** at **$1024^3$ resolution** (5.15M active cells). Timed with CUDA events around the operator alone, median of 7 runs after 2 warm-ups:*
+
+| Algorithm | Mesh Output | Extracted Vertices | Extracted Faces / Quads | Latency (ms) | Throughput |
+| :--- | :--- | ---: | ---: | ---: | ---: |
+| **DMC (pure quads)** | Pure Quads | 1,716,384 | 1,716,382 | **2.51 ms** | **684M faces/s** |
+| **Dual Marching Cubes** | Triangles | 1,716,384 | 3,432,764 | **2.62 ms** | **1,311M faces/s** |
+| MC Asymptotic | Triangles | 1,716,382 | 3,432,760 | 2.71 ms | 1,267M faces/s |
+| Dual Contouring | Triangles | 1,716,384 | 3,432,764 | 3.88 ms | 884M faces/s |
+| Marching Cubes | Triangles | 1,716,382 | 3,432,760 | 7.90 ms | 434M faces/s |
+| Marching Tetrahedra | Triangles | 6,113,918 | 12,227,832 | 44.90 ms | 272M faces/s |
 
-| Algorithm | Mesh Output | Extracted Vertices | Extracted Faces / Quads | Latency (ms) | Throughput | Watertight |
-| :--- | :--- | :--- | :--- | :---: | :---: | :---: |
-| **Dual Marching Cubes (DMC)** | Triangles | **1,716,386** | **3,432,768** | **3.44 ms** | **~1.0B faces/s** | **Yes** |
-| **Dual Marching Cubes (DMC)** | Pure Quads | **1,716,386** | **1,716,384** | **3.22 ms** | **533M quads/s** | **Yes** |
-| **Dual Contouring (DC + Normals)** | Triangles | 1,716,386 | 3,432,768 | **4.79 ms** | **717M faces/s** | **Yes** |
-| **Marching Cubes Asymptotic (MCA)** | Triangles | 1,716,384 | 3,432,764 | 16.42 ms | **209M faces/s** | **Yes** |
+All figures are produced by `docs/_figures/make_benchmarks.py` and can be reproduced. Sign-mode costs, pipeline setup breakdown and memory scaling are on the **[benchmarks page](https://khoidoo.github.io/conquer3d/benchmarks.html)**.
 
 ---
 
@@ -132,7 +143,7 @@ The API reference does not stop at the Python surface. It descends through the p
 <summary><b>🔷 1. Isosurface Extraction &amp; Meshing</b></summary>
 <br>
 
-- **Dual Marching Cubes (`dmc`)**: High-throughput manifold surface extraction with pure quad $(Q, 4)$ or triangle $(F, 3)$ outputs (~1.0B faces/s).
+- **Dual Marching Cubes (`dmc`)**: High-throughput manifold surface extraction with pure quad $(Q, 4)$ or triangle $(F, 3)$ outputs (~1.3B faces/s measured).
 - **Dual Contouring (`dc`)**: Sharp CAD crease and mechanical corner preservation via GPU Quadratic Error Function (QEF) solving.
 - **Marching Cubes Asymptotic (`mca`)**: Decider-enhanced Marching Cubes resolving topological face ambiguities on-the-fly.
 - **Differentiable Poisson Surface Reconstruction (`dpsr`, `DPSR`)**: Differentiable spectral Fourier Poisson indicator field solving directly from oriented point clouds.

{conquer3d-0.7.3 → conquer3d-0.7.4}/README.md

@@ -27,9 +27,16 @@
 
 ---
 
+> [!NOTE]
+> The API documentation and the [documentation website](https://khoidoo.github.io/conquer3d/)
+> were written with [Claude](https://claude.ai/code). The library itself — every CUDA kernel,
+> data structure and operator — is the author's own work.
+
+---
+
 ## 🌟 Overview
 
-**Conquer3D** is an ultra-fast, GPU-native computational geometry and differentiable spatial computing library engineered in **PyTorch and CUDA**. Designed from the ground up for 3D computer vision, generative AI, neural surface reconstruction, and differentiable rendering, **Conquer3D** delivers up to **~1.0 Billion faces/second** isosurface extraction, exact CAD sharp crease preservation, and memory-efficient spatial acceleration structures.
+**Conquer3D** is an ultra-fast, GPU-native computational geometry and differentiable spatial computing library engineered in **PyTorch and CUDA**. Designed from the ground up for 3D computer vision, generative AI, neural surface reconstruction, and differentiable rendering, **Conquer3D** delivers up to **~1.3 Billion faces/second** isosurface extraction, exact CAD sharp crease preservation, and memory-efficient spatial acceleration structures.
 
 Every operator consumes and produces PyTorch tensors **in place** — no host round-trip, no format conversion — so meshing a field is an operation *inside* a training step rather than a preprocessing stage around it.
 
@@ -82,14 +89,18 @@ The API reference does not stop at the Python surface. It descends through the p
 
 ## ⚡ Benchmarks
 
-*Empirical extraction performance on **NVIDIA GeForce RTX 4090** on the **Fandisk CAD model** at **$1024^3$ resolution** (6.86M sparse vertices, 5.15M active voxels):*
+*Measured on **NVIDIA GeForce RTX 4090** (torch 2.8.0+cu128, CUDA 12.8) on the **Fandisk CAD model** at **$1024^3$ resolution** (5.15M active cells). Timed with CUDA events around the operator alone, median of 7 runs after 2 warm-ups:*
+
+| Algorithm | Mesh Output | Extracted Vertices | Extracted Faces / Quads | Latency (ms) | Throughput |
+| :--- | :--- | ---: | ---: | ---: | ---: |
+| **DMC (pure quads)** | Pure Quads | 1,716,384 | 1,716,382 | **2.51 ms** | **684M faces/s** |
+| **Dual Marching Cubes** | Triangles | 1,716,384 | 3,432,764 | **2.62 ms** | **1,311M faces/s** |
+| MC Asymptotic | Triangles | 1,716,382 | 3,432,760 | 2.71 ms | 1,267M faces/s |
+| Dual Contouring | Triangles | 1,716,384 | 3,432,764 | 3.88 ms | 884M faces/s |
+| Marching Cubes | Triangles | 1,716,382 | 3,432,760 | 7.90 ms | 434M faces/s |
+| Marching Tetrahedra | Triangles | 6,113,918 | 12,227,832 | 44.90 ms | 272M faces/s |
 
-| Algorithm | Mesh Output | Extracted Vertices | Extracted Faces / Quads | Latency (ms) | Throughput | Watertight |
-| :--- | :--- | :--- | :--- | :---: | :---: | :---: |
-| **Dual Marching Cubes (DMC)** | Triangles | **1,716,386** | **3,432,768** | **3.44 ms** | **~1.0B faces/s** | **Yes** |
-| **Dual Marching Cubes (DMC)** | Pure Quads | **1,716,386** | **1,716,384** | **3.22 ms** | **533M quads/s** | **Yes** |
-| **Dual Contouring (DC + Normals)** | Triangles | 1,716,386 | 3,432,768 | **4.79 ms** | **717M faces/s** | **Yes** |
-| **Marching Cubes Asymptotic (MCA)** | Triangles | 1,716,384 | 3,432,764 | 16.42 ms | **209M faces/s** | **Yes** |
+All figures are produced by `docs/_figures/make_benchmarks.py` and can be reproduced. Sign-mode costs, pipeline setup breakdown and memory scaling are on the **[benchmarks page](https://khoidoo.github.io/conquer3d/benchmarks.html)**.
 
 ---
 
@@ -99,7 +110,7 @@ The API reference does not stop at the Python surface. It descends through the p
 <summary><b>🔷 1. Isosurface Extraction &amp; Meshing</b></summary>
 <br>
 
-- **Dual Marching Cubes (`dmc`)**: High-throughput manifold surface extraction with pure quad $(Q, 4)$ or triangle $(F, 3)$ outputs (~1.0B faces/s).
+- **Dual Marching Cubes (`dmc`)**: High-throughput manifold surface extraction with pure quad $(Q, 4)$ or triangle $(F, 3)$ outputs (~1.3B faces/s measured).
 - **Dual Contouring (`dc`)**: Sharp CAD crease and mechanical corner preservation via GPU Quadratic Error Function (QEF) solving.
 - **Marching Cubes Asymptotic (`mca`)**: Decider-enhanced Marching Cubes resolving topological face ambiguities on-the-fly.
 - **Differentiable Poisson Surface Reconstruction (`dpsr`, `DPSR`)**: Differentiable spectral Fourier Poisson indicator field solving directly from oriented point clouds.

{conquer3d-0.7.3 → conquer3d-0.7.4}/conquer3d/csrc/ops/dc_data.h

@@ -59,13 +59,20 @@ static __constant__ float dc_corner_uvw[8][3] = {
  * deterministically to one of four quadrant slots. Because adjacent cells agree on this
  * mapping, the dual quad around a shared edge is assembled consistently from all four
  * incident cells.
+ *
+ * Slots 0-3 must walk the four incident cells **counter-clockwise about the edge's own
+ * positive axis**, and all three edge families must agree on that handedness -- otherwise
+ * the faces of one family are wound backwards relative to the rest and the extracted mesh
+ * has inconsistent normals. The right-handed plane perpendicular to each axis is $(Y, Z)$
+ * for $+X$, $(Z, X)$ for $+Y$ and $(X, Y)$ for $+Z$; note that $+Y$ pairs with $(Z, X)$ and
+ * not $(X, Z)$, which is the easy mistake here.
  */
 static __constant__ int dc_edge_quadrant[12] = {
     0, // e=0 (+X) -> slot 0
     3, // e=1 (+Y) -> slot 3
-    3, // e=2 (+X) -> slot 3
+    1, // e=2 (+X) -> slot 1
     0, // e=3 (+Y) -> slot 0
-    1, // e=4 (+X) -> slot 1
+    3, // e=4 (+X) -> slot 3
     2, // e=5 (+Y) -> slot 2
     2, // e=6 (+X) -> slot 2
     1, // e=7 (+Y) -> slot 1

{conquer3d-0.7.3 → conquer3d-0.7.4}/conquer3d/csrc/ops/dmc_data.h

@@ -79,9 +79,9 @@ static __constant__ float dmc_corner_uvw[8][3] = {
 static __constant__ int dmc_edge_quadrant[12] = {
     0, // e=0 (+X) -> slot 0
     3, // e=1 (+Y) -> slot 3
-    3, // e=2 (+X) -> slot 3
+    1, // e=2 (+X) -> slot 1
     0, // e=3 (+Y) -> slot 0
-    1, // e=4 (+X) -> slot 1
+    3, // e=4 (+X) -> slot 3
     2, // e=5 (+Y) -> slot 2
     2, // e=6 (+X) -> slot 2
     1, // e=7 (+Y) -> slot 1

{conquer3d-0.7.3 → conquer3d-0.7.4}/conquer3d/csrc/ops/mc.cu

@@ -616,8 +616,15 @@ __global__ void interpolate_vertices_kernel(
  * @param[in] voxel_triangle_prefix_sums Device array of per-voxel output offsets.
  * @param[out] out_triangles Device array receiving triangle vertex index triples.
  * @note Launched with `NTHREADS` threads per block over a 1D grid.
- * @note Winding follows the table, giving outward-facing normals for a field that is
- * negative inside.
+ * @note The implementation is based on Bourke implementation at http://paulbourke.net/geometry/polygonise/.
+ * @note The adatation to CUDA at first is normal inconsistent where all normals are facing inwards.
+ * @note The canonical Lorensen-Cline / Bourke ::triTable is written for the convention
+ * that a corner bit is set when the corner is *below* the isolevel, and it winds each
+ * triangle so the right-hand normal points towards that below-isolevel region. For a
+ * signed distance field, below-isolevel is the *interior*, so emitting the table row
+ * verbatim yields inward-facing normals. The last two indices are therefore swapped on
+ * write, which reverses the winding and gives outward-facing normals for a field that is
+ * negative inside -- matching Dual Contouring and the rest of the library.
  */
 __global__ void assemble_triangles_kernel(
         const uint32_t num_active_voxels,
@@ -648,9 +655,11 @@ __global__ void assemble_triangles_kernel(
             uint32_t v1 = voxel_edge_to_vert_idx[active_voxel_idx * 12 + edge1];
             uint32_t v2 = voxel_edge_to_vert_idx[active_voxel_idx * 12 + edge2];
 
+            // Reversed winding: see the note above. The table's own order points the
+            // normal into the solid for a negative-inside field.
             out_triangles[(start_tri_idx + tri_count) * 3 + 0] = v0;
-            out_triangles[(start_tri_idx + tri_count) * 3 + 1] = v1;
-            out_triangles[(start_tri_idx + tri_count) * 3 + 2] = v2;
+            out_triangles[(start_tri_idx + tri_count) * 3 + 1] = v2;
+            out_triangles[(start_tri_idx + tri_count) * 3 + 2] = v1;
             
             tri_count++;
         }

{conquer3d-0.7.3 → conquer3d-0.7.4}/conquer3d/csrc/ops/mca.cu

@@ -310,8 +310,8 @@ __global__ void generate_edges_and_triangles_mca_kernel(
         for (int t = 0; t < 5 && tri_edges[t * 3] != -1; ++t) {
             int local_edges[3] = {
                 tri_edges[t * 3 + 0],
-                tri_edges[t * 3 + 1],
-                tri_edges[t * 3 + 2]
+                tri_edges[t * 3 + 2],
+                tri_edges[t * 3 + 1]
             };
             #pragma unroll
             for (int e_idx = 0; e_idx < 3; ++e_idx) {

{conquer3d-0.7.3 → conquer3d-0.7.4}/conquer3d/csrc/ops/mt_data.h

@@ -85,16 +85,16 @@ __constant__ int tetTriTable[16][7] = {
     {-1, -1, -1, -1, -1, -1, -1}, // 0x00
     { 0,  1,  2, -1, -1, -1, -1}, // 0x01
     { 0,  4,  3, -1, -1, -1, -1}, // 0x02
-    { 2,  1,  4,  4,  3,  1, -1}, // 0x03
+    { 1,  2,  4,  1,  4,  3, -1}, // 0x03
     { 1,  3,  5, -1, -1, -1, -1}, // 0x04
     { 0,  5,  2,  0,  3,  5, -1}, // 0x05
-    { 0,  4,  5,  0,  1,  5, -1}, // 0x06
-    { 2,  5,  4, -1, -1, -1, -1}, // 0x07
-    { 2,  4,  5, -1, -1, -1, -1}, // 0x08
-    { 0,  5,  4,  0,  1,  5, -1}, // 0x09
-    { 0,  2,  5,  0,  5,  3, -1}, // 0x0A
+    { 0,  4,  5,  0,  5,  1, -1}, // 0x06
+    { 2,  4,  5, -1, -1, -1, -1}, // 0x07
+    { 2,  5,  4, -1, -1, -1, -1}, // 0x08
+    { 0,  1,  5,  0,  5,  4, -1}, // 0x09
+    { 0,  5,  3,  0,  2,  5, -1}, // 0x0A
     { 1,  5,  3, -1, -1, -1, -1}, // 0x0B
-    { 2,  4,  1,  4,  1,  3, -1}, // 0x0C
+    { 1,  3,  4,  1,  4,  2, -1}, // 0x0C
     { 0,  3,  4, -1, -1, -1, -1}, // 0x0D
     { 0,  2,  1, -1, -1, -1, -1}, // 0x0E
     {-1, -1, -1, -1, -1, -1, -1}  // 0x0F

{conquer3d-0.7.3 → conquer3d-0.7.4}/conquer3d/csrc/ops/mtg_data.h

@@ -25,10 +25,10 @@ namespace mtg {
  */
 __constant__ int mtg_tets[6][4] = {
     {0, 2, 3, 7},
-    {0, 2, 6, 7},
+    {0, 2, 7, 6},
     {0, 4, 6, 7},
     {0, 6, 1, 2},
-    {0, 6, 1, 4},
+    {0, 6, 4, 1},
     {5, 6, 1, 4}
 };
 
@@ -60,16 +60,16 @@ __constant__ int mtg_triTable[16][7] = {
     {-1, -1, -1, -1, -1, -1, -1}, // 0x00
     { 0,  1,  2, -1, -1, -1, -1}, // 0x01
     { 0,  4,  3, -1, -1, -1, -1}, // 0x02
-    { 2,  1,  4,  4,  3,  1, -1}, // 0x03
+    { 1,  2,  4,  1,  4,  3, -1}, // 0x03
     { 1,  3,  5, -1, -1, -1, -1}, // 0x04
     { 0,  5,  2,  0,  3,  5, -1}, // 0x05
-    { 0,  4,  5,  0,  1,  5, -1}, // 0x06
-    { 2,  5,  4, -1, -1, -1, -1}, // 0x07
-    { 2,  4,  5, -1, -1, -1, -1}, // 0x08
-    { 0,  5,  4,  0,  1,  5, -1}, // 0x09
-    { 0,  2,  5,  0,  5,  3, -1}, // 0x0A
+    { 0,  4,  5,  0,  5,  1, -1}, // 0x06
+    { 2,  4,  5, -1, -1, -1, -1}, // 0x07
+    { 2,  5,  4, -1, -1, -1, -1}, // 0x08
+    { 0,  1,  5,  0,  5,  4, -1}, // 0x09
+    { 0,  5,  3,  0,  2,  5, -1}, // 0x0A
     { 1,  5,  3, -1, -1, -1, -1}, // 0x0B
-    { 2,  4,  1,  4,  1,  3, -1}, // 0x0C
+    { 1,  3,  4,  1,  4,  2, -1}, // 0x0C
     { 0,  3,  4, -1, -1, -1, -1}, // 0x0D
     { 0,  2,  1, -1, -1, -1, -1}, // 0x0E
     {-1, -1, -1, -1, -1, -1, -1}  // 0x0F

{conquer3d-0.7.3 → conquer3d-0.7.4/conquer3d.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: conquer3d
-Version: 0.7.3
+Version: 0.7.4
 Summary: Geometric Cuda Tool Box
 Author-email: Do Hoang Khoi <khoido8899@gmail.com>
 License-Expression: MIT
@@ -60,9 +60,16 @@ Dynamic: license-file
 
 ---
 
+> [!NOTE]
+> The API documentation and the [documentation website](https://khoidoo.github.io/conquer3d/)
+> were written with [Claude](https://claude.ai/code). The library itself — every CUDA kernel,
+> data structure and operator — is the author's own work.
+
+---
+
 ## 🌟 Overview
 
-**Conquer3D** is an ultra-fast, GPU-native computational geometry and differentiable spatial computing library engineered in **PyTorch and CUDA**. Designed from the ground up for 3D computer vision, generative AI, neural surface reconstruction, and differentiable rendering, **Conquer3D** delivers up to **~1.0 Billion faces/second** isosurface extraction, exact CAD sharp crease preservation, and memory-efficient spatial acceleration structures.
+**Conquer3D** is an ultra-fast, GPU-native computational geometry and differentiable spatial computing library engineered in **PyTorch and CUDA**. Designed from the ground up for 3D computer vision, generative AI, neural surface reconstruction, and differentiable rendering, **Conquer3D** delivers up to **~1.3 Billion faces/second** isosurface extraction, exact CAD sharp crease preservation, and memory-efficient spatial acceleration structures.
 
 Every operator consumes and produces PyTorch tensors **in place** — no host round-trip, no format conversion — so meshing a field is an operation *inside* a training step rather than a preprocessing stage around it.
 
@@ -115,14 +122,18 @@ The API reference does not stop at the Python surface. It descends through the p
 
 ## ⚡ Benchmarks
 
-*Empirical extraction performance on **NVIDIA GeForce RTX 4090** on the **Fandisk CAD model** at **$1024^3$ resolution** (6.86M sparse vertices, 5.15M active voxels):*
+*Measured on **NVIDIA GeForce RTX 4090** (torch 2.8.0+cu128, CUDA 12.8) on the **Fandisk CAD model** at **$1024^3$ resolution** (5.15M active cells). Timed with CUDA events around the operator alone, median of 7 runs after 2 warm-ups:*
+
+| Algorithm | Mesh Output | Extracted Vertices | Extracted Faces / Quads | Latency (ms) | Throughput |
+| :--- | :--- | ---: | ---: | ---: | ---: |
+| **DMC (pure quads)** | Pure Quads | 1,716,384 | 1,716,382 | **2.51 ms** | **684M faces/s** |
+| **Dual Marching Cubes** | Triangles | 1,716,384 | 3,432,764 | **2.62 ms** | **1,311M faces/s** |
+| MC Asymptotic | Triangles | 1,716,382 | 3,432,760 | 2.71 ms | 1,267M faces/s |
+| Dual Contouring | Triangles | 1,716,384 | 3,432,764 | 3.88 ms | 884M faces/s |
+| Marching Cubes | Triangles | 1,716,382 | 3,432,760 | 7.90 ms | 434M faces/s |
+| Marching Tetrahedra | Triangles | 6,113,918 | 12,227,832 | 44.90 ms | 272M faces/s |
 
-| Algorithm | Mesh Output | Extracted Vertices | Extracted Faces / Quads | Latency (ms) | Throughput | Watertight |
-| :--- | :--- | :--- | :--- | :---: | :---: | :---: |
-| **Dual Marching Cubes (DMC)** | Triangles | **1,716,386** | **3,432,768** | **3.44 ms** | **~1.0B faces/s** | **Yes** |
-| **Dual Marching Cubes (DMC)** | Pure Quads | **1,716,386** | **1,716,384** | **3.22 ms** | **533M quads/s** | **Yes** |
-| **Dual Contouring (DC + Normals)** | Triangles | 1,716,386 | 3,432,768 | **4.79 ms** | **717M faces/s** | **Yes** |
-| **Marching Cubes Asymptotic (MCA)** | Triangles | 1,716,384 | 3,432,764 | 16.42 ms | **209M faces/s** | **Yes** |
+All figures are produced by `docs/_figures/make_benchmarks.py` and can be reproduced. Sign-mode costs, pipeline setup breakdown and memory scaling are on the **[benchmarks page](https://khoidoo.github.io/conquer3d/benchmarks.html)**.
 
 ---
 
@@ -132,7 +143,7 @@ The API reference does not stop at the Python surface. It descends through the p
 <summary><b>🔷 1. Isosurface Extraction &amp; Meshing</b></summary>
 <br>
 
-- **Dual Marching Cubes (`dmc`)**: High-throughput manifold surface extraction with pure quad $(Q, 4)$ or triangle $(F, 3)$ outputs (~1.0B faces/s).
+- **Dual Marching Cubes (`dmc`)**: High-throughput manifold surface extraction with pure quad $(Q, 4)$ or triangle $(F, 3)$ outputs (~1.3B faces/s measured).
 - **Dual Contouring (`dc`)**: Sharp CAD crease and mechanical corner preservation via GPU Quadratic Error Function (QEF) solving.
 - **Marching Cubes Asymptotic (`mca`)**: Decider-enhanced Marching Cubes resolving topological face ambiguities on-the-fly.
 - **Differentiable Poisson Surface Reconstruction (`dpsr`, `DPSR`)**: Differentiable spectral Fourier Poisson indicator field solving directly from oriented point clouds.

{conquer3d-0.7.3 → conquer3d-0.7.4}/pyproject.toml

@@ -13,7 +13,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "conquer3d"
-version = "0.7.3"
+version = "0.7.4"
 description = "Geometric Cuda Tool Box"
 readme = "README.md"
 license = "MIT"