Geodesic Distance / Split Mesh

Open
#92 1 comment 1 reaction 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
cpp
Domain
computer-graphics

Research direction

No files, tests, or entry points are named. First clarify the intended API and how vertex values, boundary vertices, and disconnected regions should determine the ten mesh segments. Done should include a documented geodesic-distance split operation and tests covering the 0.0–1.0 intervals.

Written by the indexing model from the issue text.

Description

Hi,

Is there a method to split a mesh based on a geodesic vertex distance?

For example vertices have mapped values from 0 to 1 and I would like to segment a mesh into 10 meshes e.g. from 0.0 to 0.1, 0.1 to 0.2 and so on until 0.9 to 1.0.

Geodesics

Dominant language
C++
Stars
1.3k
Forks
183
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from nmwsharp/geometry-central

All issues in nmwsharp/geometry-central

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.