We have a non-default operator to do a Dulauney triangulation of a set of points. It works for small numbers of points but takes forever on a dataset consisting of 700,000 points. I suspect an n^2 algorithm somewhere in the VTK datasets. Maybe there is a spatial partitioning speedup missing?
-----------------------REDMINE MIGRATION-----------------------
This ticket was migrated from Redmine. As such, not all
information was able to be captured in the transition. Below is
a complete record of the original redmine ticket.
Ticket number: 2048
Status: Pending
Project: VisIt
Tracker: Bug
Priority: Normal
Subject: suspect n^2 algorithm in Dulauney algorithm
Assigned to: -
Category: -
Target version: -
Author: Mark Miller
Start: 10/29/2014
Due date:
% Done: 0%
Estimated time:
Created: 10/29/2014 02:45 pm
Updated: 11/12/2014 04:55 pm
Likelihood: 3 - Occasional
Severity: 2 - Minor Irritation
Found in version: 2.7.3
Impact:
Expected Use:
OS: All
Support Group: Any
Description:
We have a non-default operator to do a Dulauney triangulation of a set of points. It works for small numbers of points but takes forever on a dataset consisting of 700,000 points. I suspect an n^2 algorithm somewhere in the VTK datasets. Maybe there is a spatial partitioning speedup missing?
We have a non-default operator to do a Dulauney triangulation of a set of points. It works for small numbers of points but takes forever on a dataset consisting of 700,000 points. I suspect an n^2 algorithm somewhere in the VTK datasets. Maybe there is a spatial partitioning speedup missing?
-----------------------REDMINE MIGRATION----------------------- This ticket was migrated from Redmine. As such, not all information was able to be captured in the transition. Below is a complete record of the original redmine ticket.
Ticket number: 2048 Status: Pending Project: VisIt Tracker: Bug Priority: Normal Subject: suspect n^2 algorithm in Dulauney algorithm Assigned to: - Category: - Target version: - Author: Mark Miller Start: 10/29/2014 Due date: % Done: 0% Estimated time: Created: 10/29/2014 02:45 pm Updated: 11/12/2014 04:55 pm Likelihood: 3 - Occasional Severity: 2 - Minor Irritation Found in version: 2.7.3 Impact: Expected Use: OS: All Support Group: Any Description: We have a non-default operator to do a Dulauney triangulation of a set of points. It works for small numbers of points but takes forever on a dataset consisting of 700,000 points. I suspect an n^2 algorithm somewhere in the VTK datasets. Maybe there is a spatial partitioning speedup missing?
Comments: