missing edges in Voronoi diagram

Open
#43 7 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
4/5
Estimated time
3-5 days
Newbie friendliness
38/100
Issue type
Bug
Clarity
Mostly clear
Activity status
Stale
Tech stack
cpp

Research direction

Start by reproducing the missing-edge result in the Boost Polygon module with the six coordinates listed in the issue, paying particular attention to the point whose second coordinate must be 1. Inspect the Voronoi construction path and compare its output with the expected edges; done means the distilled polygon no longer loses edges and the regression is covered by an appropriate test.

Written by the indexing model from the issue text.

Description

This is a follow-up on https://svn.boost.org/trac10/ticket/12707
where a smallest possible polygon has been distilled:

    {       0, 10000000},
    {  700000,        1}, // it has to be 1, higher number, zero or -1 work.
    {  700000,  9000000},
    { 9100000,  9000000},
    { 9100000,        0},
    {10000000, 10000000}

I have rounded the coordinates to nice numbers for easier debugging.

image

Dominant language
C++
Stars
70
Forks
76
PR merge metrics
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 boostorg/polygon

All issues in boostorg/polygon

Similar issues

More C++ issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.