Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Fortune's algorithm

Fortune's algorithm is a sweep line algorithm for generating a Voronoi diagram from a set of points in a plane using O(n log n) time and O(n) space. It was originally published by Steven Fortune in 1986 in his paper "A sweepline algorithm for Voronoi diagrams."

Algorithm description, Weighted sites and disks & Overview

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Fortune's algorithm. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Algorithm description

7 related topics

Weighted sites and disks

3 related topics

Overview

3 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Algorithm description

Weighted sites and disks

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Fortune's algorithm

Nodes17
Edges16
Triples8
Avg. degree1.88
Density0.117647
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Fortune's algorithm

Top relations

related to External links · 7
Fortune's algorithm → Algorithm Visualization, August, Fortune's, GitHub, JavaScript, Steven Fortune's, Voronoi
is a · 1
Fortune's algorithm → sweep line algorithm for generating a Voronoi diagram from a set of points in a plane using O

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

line algorithm sweep voronoi beach diagram points sites parabolas plane time weighted may left point parabola using log diagrams disks

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Fortune's algorithmis asweep line algorithm for generating a Voronoi diagram from a set of points in a plane using O0.90text
Fortune's algorithmrelated to External linksSteven Fortune's0.60section
Fortune's algorithmrelated to External linksVoronoi0.60section
Fortune's algorithmrelated to External linksFortune's0.60section
Fortune's algorithmrelated to External linksJavaScript0.60section
Fortune's algorithmrelated to External linksGitHub0.60section
Fortune's algorithmrelated to External linksAugust0.60section
Fortune's algorithmrelated to External linksAlgorithm Visualization0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.