Research > Software > ConvexHull

ConvexHull is a Java based tool that computes the convex hull of a given shape. The convex hull is the minimal convex set that contains the vertices of the given shape. Similarly, the convex hull is the intersection of all convex sets that contain the given shape.

Features

- The application supports Ucf, Obj, Off and Dx input surface formats.
- By default, the output surface format is the same as the input surface format. However, the user can specify Dx surface output or a simple text file format.

Description

ConvexHull is a java based tool that computes the convex hull of a given shape. The convex hull is defined as the minimal convex set that contains the vertices of the given shape. Similarly, the convex hull is the intersection of all convex sets that contain the given shape. The convex hull can be imagined as a surface that wraps the given shape.

Usage

System Requirements

- OS: any
- Processor: any
- Memory: Data-dependent
- Other: Java 1.5 (or higher) runtime environment

Installation

Compilation

Portable java executable makes compilation unnecessary.

Installation Instructions

Copy java executable 'jar' file to local disk

Purpose

ConvexHull supports the specification of a surface in any of the following formats: Ucf, Obj, Off, Dx. The computed convex hull will be written in the same format as the input shape. However, the user may specify a different data type.

The tool can be used for many problems in computational geometry. For example, the Delaunay triangulation and Voronai diagram are closely related to the convex hull. Many algorithms use the convex hull as a starting point; for example, the computation of a shape's diameter is very efficient when the convex hull is available.