Skip to content

Implement elementary geometry algorithms #12

Description

@callmekeypuncher

Description

To implement Boolean operations we have to use elementary geometry algorithms (intersection of straight lines, distance between points etc).

Proposed solution

We can implement a module with elementary geometry algorithms.

module Primitives
  module Elementary
    def distance_points(p1, p2)
      # Your implementation goes here...
    end

    # Other algorithms implementation goes here...

    def intersect_straight_lines(straight_line1, straight_line2)
      # Your implementation goes here...
    end
  end
end

Alternatives considered

You can suggest your own implementation.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions