This is an application made for educational purposes. It demonstrates some basic algorithms of computational geometry in 2D space. You can create, edit and delete points and vectors and then choose them as the input for algorithms selectable from the menu. Import and export from a to XML files is also possible.

Many thanks to GeoSoft for providing open-source library G which was used for 2D graphics. You can find it here: http://geosoft.no/graphics/index.html

Features

  • Calculating the cross product of 2 vectors
  • Detecting an intersection of 2 vectors
  • Detecting if any of multiple vectors intersect (Sweep Line)
  • Finding the convex hull (Graham's Scan & Jarvis's March)
  • Finding the closest pair of points (Divide-And-Conquer)
  • Testing algorithms with random input
  • Full documentation

Project Samples

Convex hull

Project Activity

See All Activity >

Follow ComputationalGeometry

ComputationalGeometry Web Site

Other Useful Business Software
$300 in Free Credit Towards Top Cloud Services Icon
$300 in Free Credit Towards Top Cloud Services

Build VMs, containers, AI, databases, storage—all in one place.

Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
Get Started
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of ComputationalGeometry!

Additional Project Details

Operating Systems

FreeBSD, Linux, OpenBSD, Solaris, Windows

Languages

English

Intended Audience

End Users/Desktop

User Interface

Java AWT, Java Swing

Programming Language

Java

Registered

2014-06-03
Report inappropriate content