Simple Mesh and Half Edge Data Structure Python Library

Table of Contents

• Introduction
• Installation
• Interactive app usage
• Visualization
• Benchmarking
• Documentation
• License

Introduction

This project provides an implementation of Simple Mesh and Half Edge data structures in Python. It includes tools for algorithms and data visualization and benchmarking.

Project realized by:

• Adrian Mikoda [adrianmikoda]
• Marcin Otte [marcin-otte]

Installation

To install the necessary dependencies, run:

pip install -r requirements.txt

Interactive app usage

The interactive app can be launched by running:

streamlit run app.py

in the root directory of the project.

Visualization

Visualizations can be generated by running the cells in main.ipynb.

All of the data generated is saved inside the data/results directory.

Example Simple Mesh Data Structure algorithms Visualization

• OP1 - vertex neigborhood: Shows the algorithm steps of finding the neigborhood of a vertex.

• OP2 - triangle neigborhood: Shows the algorithm steps of finding the neigborhood of a triangle.

• OP3 - triangle containing a point: Shows the algorithm steps of finding the triangle containing a point.

Example Half Edge Data Structure algorithms Visualization

• OP1 - vertex neigborhood: Shows the algorithm steps of finding the neigborhood of a vertex.

• OP2 - triangle neigborhood: Shows the algorithm steps of finding the neigborhood of a triangle.

• OP3 - triangle containing a point: Shows the algorithm steps of finding the triangle containing a point.

Benchmarking

Benchmarks can be generated by running the cells in benchmark.ipynb.

All of the data generated is saved inside the data/results directory.

Example Benchmarks

Documentation

The project includes detailed documentation in the form of PDF files (in Polish):

• report - detailed project report,
• user manual - user manual,
• documentation - documentation of the project.

License

This project is licensed under the MIT License. See the LICENSE file for details.