4
$\begingroup$

I'm considering the planar BSP problem, where we are required to partition a set of disjoint line segments in the plane, such that every region in the partition contains at most one line segment or a portion of one line segment.

My question is: is there a way of partition these line segments such that no line segment is split into more than one region?

asked Jul 3, 2021 at 8:12
$\endgroup$

1 Answer 1

3
$\begingroup$

The answer is "No". Please see a counterexample below: 3Segments

answered Jul 4, 2021 at 4:45
$\endgroup$

Your Answer

Draft saved
Draft discarded

Sign up or log in

Sign up using Google
Sign up using Email and Password

Post as a guest

Required, but never shown

Post as a guest

Required, but never shown

By clicking "Post Your Answer", you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.