marching-simplex-table

WebJar for marching-simplex-table

License

License

MIT
GroupId

GroupId

org.webjars.npm
ArtifactId

ArtifactId

marching-simplex-table
Last Version

Last Version

1.0.0
Release Date

Release Date

Type

Type

jar
Description

Description

marching-simplex-table
WebJar for marching-simplex-table
Project URL

Project URL

http://webjars.org
Source Code Management

Source Code Management

https://github.com/mikolalysenko/marching-simplex-table

Download marching-simplex-table

How to add to project

<!-- https://jarcasting.com/artifacts/org.webjars.npm/marching-simplex-table/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>marching-simplex-table</artifactId>
    <version>1.0.0</version>
</dependency>
// https://jarcasting.com/artifacts/org.webjars.npm/marching-simplex-table/
implementation 'org.webjars.npm:marching-simplex-table:1.0.0'
// https://jarcasting.com/artifacts/org.webjars.npm/marching-simplex-table/
implementation ("org.webjars.npm:marching-simplex-table:1.0.0")
'org.webjars.npm:marching-simplex-table:jar:1.0.0'
<dependency org="org.webjars.npm" name="marching-simplex-table" rev="1.0.0">
  <artifact name="marching-simplex-table" type="jar" />
</dependency>
@Grapes(
@Grab(group='org.webjars.npm', module='marching-simplex-table', version='1.0.0')
)
libraryDependencies += "org.webjars.npm" % "marching-simplex-table" % "1.0.0"
[org.webjars.npm/marching-simplex-table "1.0.0"]

Dependencies

compile (1)

Group / Artifact Type Version
org.webjars.npm : convex-hull jar [1.0.3,2)

Project Modules

There are no modules declared in this project.

marching-simplex-table

Constructs a look up table for the marching simplex isosurface extraction algorithm. The entries of this table correspond to the different topologies that can occur for marching simplices.

Example

var makeTable = require('marching-simplex-table')

console.log(makeTable(2))
console.log(makeTable(3))

Install

npm install marching-simplex-table

API

require('marching-simplex-table')(d)

Constructs the marching simplex table for all simplices of dimension d. The result is a table with 2^(d+1) entries, each corresponding to the (d-1) dimensional cells needed to generate the boundary of the simplex. Each (d-1) cell is coded as an ordered list of edges in the original simplex giving the vertices of the resulting simplex.

  • d is the dimension of the table to generate

Returns A table of simplex topologies

Credits

(c) 2014 Mikola Lysenko. MIT License

Versions

Version
1.0.0