Skip to content

Commit

Permalink
updated README to new name
Browse files Browse the repository at this point in the history
  • Loading branch information
anicusan committed Jul 1, 2023
1 parent 9996c17 commit 0cf5454
Showing 1 changed file with 9 additions and 9 deletions.
18 changes: 9 additions & 9 deletions README.md
View file
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
[![](https://img.shields.io/badge/docs-stable-blue.svg)](https://stellaorg.github.io/IBVH.jl/stable)
[![](https://img.shields.io/badge/docs-dev-blue.svg)](https://stellaorg.github.io/IBVH.jl/dev)
[![](https://img.shields.io/badge/docs-stable-blue.svg)](https://stellaorg.github.io/ImplicitBVH.jl/stable)
[![](https://img.shields.io/badge/docs-dev-blue.svg)](https://stellaorg.github.io/ImplicitBVH.jl/dev)

# IBVH.jl
# ImplicitBVH.jl
*Fast, Robust Parallel Bounding Volume Hierarchy for Collision Detection in Dynamic Scenes*

It uses an implicit bounding volume hierarchy constructed from an iterable of some geometric
Expand All @@ -21,8 +21,8 @@ detection downwards from this level.
Simple usage with bounding spheres and default 64-bit types:

```julia
using IBVH
using IBVH: BBox, BSphere
using ImplicitBVH
using ImplicitBVH: BBox, BSphere
using StaticArrays

# Generate some simple bounding spheres
Expand All @@ -49,8 +49,8 @@ Using `Float32` bounding spheres for leaves, `Float32` bounding boxes for nodes
Morton codes:

```julia
using IBVH
using IBVH: BBox, BSphere
using ImplicitBVH
using ImplicitBVH: BBox, BSphere
using StaticArrays

# Generate some simple bounding spheres
Expand Down Expand Up @@ -86,7 +86,7 @@ Check out the `benchmark` folder for an example traversing an STL model.

# Implicit Bounding Volume Hierarchy

The main idea behind the IBVH is the use of an implicit perfect binary tree constructed from some
The main idea behind the ImplicitBVH is the use of an implicit perfect binary tree constructed from some
bounding volumes. If we had, say, 5 objects to construct the BVH from, it would form an incomplete
binary tree as below:

Expand Down Expand Up @@ -118,4 +118,4 @@ The implicit tree formulation (genius idea!) which forms the core of the BVH str

# License
`IBVH.jl` is MIT-licensed. Enjoy.
`ImplicitBVH.jl` is MIT-licensed. Enjoy.

2 comments on commit 0cf5454

@anicusan
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@JuliaRegistrator register

@JuliaRegistrator
Copy link

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Registration pull request created: JuliaRegistries/General/86654

After the above pull request is merged, it is recommended that a tag is created on this repository for the registered package version.

This will be done automatically if the Julia TagBot GitHub Action is installed, or can be done manually through the github interface, or via:

git tag -a v0.2.0 -m "<description of version>" 0cf54544e749051607dcc39188ccf0f59988beb8
git push origin v0.2.0

Also, note the warning: This looks like a new registration that registers version 0.2.0.
Ideally, you should register an initial release with 0.0.1, 0.1.0 or 1.0.0 version numbers
This can be safely ignored. However, if you want to fix this you can do so. Call register() again after making the fix. This will update the Pull request.

Please sign in to comment.