[
https://issues.apache.org/jira/browse/GEOMETRY-144?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17687515#comment-17687515
]
Matt Juntunen commented on GEOMETRY-144:
----------------------------------------
bq. i think that is a good proposition. At least in the three-dimensional case
the Mesh seems to be more fitting than ConvexHull. What would we then do with
two-dimensional algorithm is the end product LinePath?
Great! Yes, {{LinePath}} is what I was picturing for 2D.
bq. Having thought about it some more i believe we could go with the Builder
pattern and make use of some heuristic like the Akl- Toussaint in the two
dimensional case. I think one could continuously adjust the given quadrangle
constructed and test all points previously added against it. Matt Juntunen you
probably had something similar in mind.
Yes, exactly. I'm picturing a simple test as points are added to skip points
clearly not on the hull. After that, the full {{Quickhull}} algorithm would be
run on what remains.
> Review API in "hull" module
> ---------------------------
>
> Key: GEOMETRY-144
> URL: https://issues.apache.org/jira/browse/GEOMETRY-144
> Project: Commons Geometry
> Issue Type: Task
> Reporter: Gilles Sadowski
> Assignee: Gilles Sadowski
> Priority: Minor
> Fix For: 1.1
>
>
> Review codes in the
> [{{commons-geometry-hull}}|https://gitbox.apache.org/repos/asf?p=commons-geometry.git;a=tree;f=commons-geometry-hull;hb=HEAD]
> module.
> (x) Minimize the public API
--
This message was sent by Atlassian Jira
(v8.20.10#820010)
