berkus
/
topola
mirror of https://codeberg.org/topola/topola.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
topola/crates/planar-incr-embed
History
Ellen Emilia Anna Zscheile 7799c50829 feat(math): implement search for boundaries of partitions in cyclic partitioned lists. 
e.g. find the bounds of false, true in [false, true, true, false, false]
under the condition that the blocks in partitions of a single value are connected,
meaning when considering the list as cyclic, there are at most 2 blocks (for value true, false).
This implements only the binary case.

Exponential search was suggested by Harold Aptroot <@harold@mastodon.gamedev.place>

Example/motivating use case: detecting which parts of the exterior of a Polygon
  face towards a point, and which parts don't, in particular finding the (extremal) points
  contained in the tangents. This use case is implemented in `poly_ext_tangent_points`.

Signed-off-by: Ellen Emilia Anna Zscheile <fogti+devel@ytrizja.de>
 		2025-05-01 15:28:20 +02:00
..
src chore(planar-incr-embed): make some utilities public for downstream reuse 2025-04-25 13:25:28 +02:00
tests feat: merge planar-brute-embed into the topola monorepo 2025-02-16 18:31:31 +01:00
Cargo.toml feat(math): implement search for boundaries of partitions in cyclic partitioned lists. 2025-05-01 15:28:20 +02:00
README.md feat: merge planar-brute-embed into the topola monorepo 2025-02-16 18:31:31 +01:00

README.md

planar-incr-embed

WIP implementation of incrementally finding planar graph embeddings modulo homotopy equivalence with fixed vertex positions.