Simon Giraudot
|
6a0ee7e673
|
Method to get detailed output
|
2015-11-13 12:36:27 +01:00 |
Simon Giraudot
|
38b6c428f3
|
Simplified API + function to get output points
|
2015-11-13 11:11:39 +01:00 |
Simon Giraudot
|
a7d7efbb22
|
Plane resampling
|
2015-11-13 10:50:04 +01:00 |
Simon Giraudot
|
8b8f97217b
|
Merging corners
|
2015-11-13 10:02:14 +01:00 |
Simon Giraudot
|
06814e1a8a
|
Corner computation
|
2015-11-13 09:13:10 +01:00 |
Simon Giraudot
|
dcf06b4a13
|
Creation of edge points and anchor points
|
2015-11-12 14:58:43 +01:00 |
Simon Giraudot
|
b1d9d6b611
|
Computing edges
|
2015-11-12 10:48:05 +01:00 |
Simon Giraudot
|
ee247e6f90
|
Bugfix: inserting *it and not *begin in loop
|
2015-11-12 09:51:39 +01:00 |
Simon Giraudot
|
cc934e45bb
|
WIP: finding pairs of adjacent primitives
|
2015-11-10 15:43:32 +01:00 |
Simon Giraudot
|
baa54120a4
|
Add data for the new example
|
2015-11-10 15:21:42 +01:00 |
Simon Giraudot
|
61192d7b9d
|
Point set structuring example
|
2015-11-10 10:50:08 +01:00 |
Simon Giraudot
|
6b0cccad0b
|
File for point set structuring + general structure
|
2015-11-10 10:49:47 +01:00 |
Simon Giraudot
|
99d4fc84bd
|
Merge branch 'Point_set_processing_3-IO_ply-GF-old' into Point_set_processing_3-IO_ply-GF
|
2015-10-15 14:27:57 +02:00 |
Laurent Rineau
|
18cac48bae
|
Merge pull request #367 from sgiraudot/Point_set_processing-hierarchical_clustering-sgiraudot
New point set processing algorithm: Hierarchical clustering
|
2015-10-14 10:54:37 +02:00 |
Clement Jamin
|
145131e2e6
|
Use Real_timer in PSP3 and T3 since the algorithms might be parallel
|
2015-10-08 15:34:40 +02:00 |
Simon Giraudot
|
09d2c9e5a4
|
Revert removal of hack to handle char properly (std::stream treats boost::int8_t as char)
|
2015-10-08 10:18:16 +02:00 |
Simon Giraudot
|
39eef61847
|
Add headers
|
2015-10-08 10:08:39 +02:00 |
Simon Giraudot
|
f614ce4ea1
|
Remove useless includes
|
2015-10-08 10:08:20 +02:00 |
Simon Giraudot
|
833982a32f
|
Use boost fixed-width integer types for portability (and remove hack for reading ASCII 'char')
|
2015-10-08 09:52:45 +02:00 |
Simon Giraudot
|
eb430e2397
|
Harmonize template indentation and remove outdated header
|
2015-10-08 09:24:35 +02:00 |
Simon Giraudot
|
79ca962159
|
Merge branch 'Point_set_processing_3-IO_ply-GF-old' into Point_set_processing_3-IO_ply-GF
|
2015-10-08 08:48:39 +02:00 |
Simon Giraudot
|
512273ae5f
|
Update doc and tests
|
2015-10-08 08:47:14 +02:00 |
Simon Giraudot
|
0916c32ded
|
Fix numeric_limits::max bug (conflict with other max)
|
2015-10-08 07:59:56 +02:00 |
Simon Giraudot
|
bc2a944ded
|
Fix Visual Studio errors (typename + max macro bug)
|
2015-10-07 16:03:08 +02:00 |
Simon Giraudot
|
b35e34238a
|
Bugfix: if 2 input points are equal, avoid infinite loop and terminate non-empty cluster
|
2015-10-07 16:00:54 +02:00 |
Simon Giraudot
|
564f156eeb
|
Fix typos in doc
|
2015-10-07 16:00:54 +02:00 |
Simon Giraudot
|
a068249ac5
|
Minor code cleaning/rewriting
|
2015-10-07 16:00:53 +02:00 |
Simon Giraudot
|
e028ff8955
|
Update doc and example
|
2015-10-07 16:00:53 +02:00 |
Simon Giraudot
|
e6054bfdeb
|
Rename function and files in accordance to content
|
2015-10-07 16:00:53 +02:00 |
Simon Giraudot
|
20698d4dde
|
Make the algorithm a simplification algorithm instead of a clustering one
|
2015-10-07 16:00:53 +02:00 |
Simon Giraudot
|
347af82e80
|
Fix testsuite error (missing #include <limits>)
|
2015-10-07 16:00:53 +02:00 |
Simon Giraudot
|
28cf05f189
|
Remove duplicate code (use PCA_util.h to assemble covariance matrix)
|
2015-10-07 16:00:52 +02:00 |
Simon Giraudot
|
648c19b6f6
|
Remove unused typedef warning
|
2015-10-07 16:00:52 +02:00 |
Simon Giraudot
|
b16f7605d6
|
Enhancement: keep current cluster an only build one side instead of two
|
2015-10-07 16:00:52 +02:00 |
Simon Giraudot
|
cf9b7230d8
|
Algorithm is faster if the plane is not constructed
|
2015-10-07 16:00:52 +02:00 |
Simon Giraudot
|
5df527d2f0
|
Correct preconditions
|
2015-10-07 16:00:52 +02:00 |
Simon Giraudot
|
c965754d00
|
Update example of hierarchical clustering
|
2015-10-07 16:00:52 +02:00 |
Simon Giraudot
|
59e11b4ae6
|
More on user manual
|
2015-10-07 16:00:52 +02:00 |
Simon Giraudot
|
b84b724984
|
Add citation and update manual
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
bf8d876d6d
|
More on user manual and reference manual
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
bd52620404
|
Add a test for hierarchical_clustering
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
e6c757f463
|
Begin working on reference manual
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
14567ae261
|
Add variant with default diagonalize traits
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
fea22733ee
|
Speed up using list instead of queue (avoid multiple copies) + bugfix
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
5ab793531c
|
Bugfix: if one of the two sides is empty, only treat the non-empty side
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
ed2d3167e2
|
Stack is faster than queue in this case
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
7babff9f05
|
Optimizations (using splice for lists and reference for queue.front())
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
0841e423a2
|
Add example for hierarchical clustering
|
2015-10-07 16:00:51 +02:00 |
Simon Giraudot
|
eb7266a42d
|
Cleaning/reorganizing code, use diagonalize_traits and add variants with default parameters and template deduction
|
2015-10-07 16:00:50 +02:00 |
Simon Giraudot
|
e8dd34cb21
|
Implemented the efficient computation of the second centroid.
The hierarchical clustering algorithm gets about 15% faster
(on test Eglise Fontaine, from 91s to 76s).
|
2015-10-07 16:00:50 +02:00 |