npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

marching-cubes-faster

v0.0.151

Published

CSG-like version of `marching-cubes-fast`, very fast marching cubes mesher

Downloads

11

Readme

marching-cubes-faster

Even faster [but less generic] version of marching-cubes-fast that allows you to build distance functions using CSG-like primitives.

Internally, the primitives are organized by an R-tree via rbush-3d.

Similar to marching-cubes-fast, this tool efficiently generates a list of surface cells with an octree-like recursive structure. As that happens, this tool queries the R-tree to associate each leaf cell with only the primitives potentially affecting it. Finally the kernel is run on the leaves.

In practice this means the kernel is only dealing with 1 or 2 primitives at a time for the vast majority of surface cells, and the runtime is roughly proportional to surface area [eg the final number of cells].

Installation

npm i marching-cubes-faster

Usage

var mfc = require('marching-cubes-faster');
var mb = mfc.meshBuilder;
var dfb = mfc.dfBuilder;

var t0=Date.now();
var theList = [];

for(var i=0; i<1000; i++){
    var radius = 8;
    //functions for adding shapes
    //dfb.addBrick(theList, dfb.randomBrick(), radius); //add an aabb [[x,y,z],[x,y,z]] with radius padding
    //dfb.addTriangle(theList, dfb.randomTriangle(), radius); //add a triangle [[x,y,z],[x,y,z],[x,y,z]] with radius padding [thickness]
    //dfb.addTetra(theList, dfb.randomTetrahedron(), radius); //add a tetrahedron [[x,y,z],[x,y,z],[x,y,z],[x,y,z]] with radius padding
    dfb.addLine(theList, dfb.randomLine(), radius); //add a line segment [[x,y,z],[x,y,z]] with radius thickness
    //dfb.addLineCone(theList, dfb.randomLineCone()); //add a line segment with different end radii r0 and r1 {line:[[x,y,z],[x,y,z]], r0, r1}

    //similar functions for subtracting shapes
    //dfb.subtractBrick(theList, dfb.randomBrick(), radius);
    //dfb.subtractTriangle(theList, dfb.randomTriangle(), radius);
    //dfb.subtractTetra(theList, dfb.randomTetrahedron(), radius);
    //dfb.subtractLine(theList, dfb.randomLine(), radius);
    //dfb.subtractLineCone(theList, dfb.randomLineCone(), radius);
}

var iters = 6; //how many times to subdivide the octree. increasing by 1 will double the number of triangles in the result.
var result = mb.buildForList(theList,iters); //{cells, positions, dfBuilderResult} //dfBuilderResult contains {rtree, rTreeObjs}

//note - by default, the function meshes the bounding box of the entire set of primitives

//if you want to build only an arbitrary bounding box:
//var result = mb.buildForList(theList, iters, boundingBox); //boundingBox = [[x,y,z],[x,y,z]]

//full params:
//buildForList(dfObjList, iters=5, renderBlock = dfListBounds(dfObjList), _dfBuilderResult?)
//set _dfBuilderResult if you want to re-use an rtree from a previous call

lines

^ result as rendered with ascii-raytracer [see test.js]

See Also

stonks