Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings
#

segment-intersection

Here are 8 public repositories matching this topic...

Pure Python implementation of a sweep line algorithm for line-segment intersections, based on a paper by Mehlhorn and Näher.

  • UpdatedFeb 18, 2022
  • Python

Java implementation of Bentley-Ottmann segments intersection finding algorithm

  • UpdatedDec 14, 2021
  • Java

Implements the Balaban algorithm for finding intersecting segment pairs from a set of line segments.

  • UpdatedJan 25, 2025
  • Java

Simple two segment intersection

  • UpdatedFeb 18, 2024
  • TypeScript

A B-Tree implementation of sweep line algorithm for segment intersection

  • UpdatedDec 2, 2024
  • C++

This repository contains my own computational geometry Python package: geometric. It covers fundamental algorithms and data structures, with a focus on practical applications.

  • UpdatedMay 24, 2023
  • Python

Improve this page

Add a description, image, and links to thesegment-intersection topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with thesegment-intersection topic, visit your repo's landing page and select "manage topics."

Learn more


[8]ページ先頭

©2009-2025 Movatter.jp