1. 04 May, 2020 1 commit
  2. 31 Oct, 2019 1 commit
  3. 19 Jul, 2019 1 commit
  4. 09 Jul, 2019 1 commit
    • Mark Olesen's avatar
      ENH: support different iso-algorithms (#1374) · 7805fb45
      Mark Olesen authored
      - add an 'isoAlgorithm' keyword to distance surface and cutting plane
        to advance further testing of the isoSurfaceTopo algorithm.
      
        Does not yet handle the full spectrum of bound boxes, cellZones etc.
      7805fb45
  5. 06 Feb, 2019 1 commit
  6. 23 Jul, 2018 1 commit
    • Mark Olesen's avatar
      ENH: handling of open edges distanceSurface at 0 (issue #948) · 18b13431
      Mark Olesen authored
      Some special adjustments are undertaken for distance = 0.
      
      - With the isoSurfaceCell algorithm is used, additional checks for open
        surfaces edges are used to limit the extend of resulting distance
        surface. The resulting surface elements will not, however, contain
        partial cell coverage.
      
      - Always treated as signed (ignoring the input value), since it is
        nearly impossible to generate any surface otherwise.
      18b13431
  7. 01 Jun, 2018 1 commit
    • Mark Olesen's avatar
      STYLE: reduced usage of Switch · 84b10921
      Mark Olesen authored
      - Since 'bool' and 'Switch' use the _identical_ input mechanism
        (ie, both accept true/false, on/off, yes/no, none, 1/0), the main
        reason to prefer one or the other is the output.
      
        The output for Switch is as text (eg, "true"), whereas for bool
        it is label (0 or 1). If the output is required for a dictionary,
        Switch may be appropriate. If the output is not required, or is only
        used for Pstream exchange, bool can be more appropriate.
      84b10921
  8. 07 May, 2018 1 commit
    • Mark Olesen's avatar
      ENH: improvements in the surface sampling infrastructure · b0648f2b
      Mark Olesen authored
      - improvement documentation for surface sampling.
      
      - can now specify alternative sampling scheme for obtaining the
        face values instead of just using the "cell" value. For example,
      
            sampleScheme    cellPoint;
      
        This can be useful for cases when the surface is close to a boundary
        cell and there are large gradients in the sampled field.
      
      - distanceSurface now handles non-closed surfaces more robustly.
        Unknown regions (not inside or outside) are marked internally and
        excluded from consideration. This allows use of 'signed' surfaces
        where not previously possible.
      b0648f2b
  9. 07 Mar, 2018 1 commit
    • Mark Olesen's avatar
      ENH: new bitSet class and improved PackedList class (closes #751) · bac943e6
      Mark Olesen authored
      - The bitSet class replaces the old PackedBoolList class.
        The redesign provides better block-wise access and reduced method
        calls. This helps both in cases where the bitSet may be relatively
        sparse, and in cases where advantage of contiguous operations can be
        made. This makes it easier to work with a bitSet as top-level object.
      
        In addition to the previously available count() method to determine
        if a bitSet is being used, now have simpler queries:
      
          - all()  - true if all bits in the addressable range are empty
          - any()  - true if any bits are set at all.
          - none() - true if no bits are set.
      
        These are faster than count() and allow early termination.
      
        The new test() method tests the value of a single bit position and
        returns a bool without any ambiguity caused by the return type
        (like the get() method), nor the const/non-const access (like
        operator[] has). The name corresponds to what std::bitset uses.
      
        The new find_first(), find_last(), find_next() methods provide a faster
        means of searching for bits that are set.
      
        This can be especially useful when using a bitSet to control an
        conditional:
      
        OLD (with macro):
      
            forAll(selected, celli)
            {
                if (selected[celli])
                {
                    sumVol += mesh_.cellVolumes()[celli];
                }
            }
      
        NEW (with const_iterator):
      
            for (const label celli : selected)
            {
                sumVol += mesh_.cellVolumes()[celli];
            }
      
            or manually
      
            for
            (
                label celli = selected.find_first();
                celli != -1;
                celli = selected.find_next()
            )
            {
                sumVol += mesh_.cellVolumes()[celli];
            }
      
      - When marking up contiguous parts of a bitset, an interval can be
        represented more efficiently as a labelRange of start/size.
        For example,
      
        OLD:
      
            if (isA<processorPolyPatch>(pp))
            {
                forAll(pp, i)
                {
                    ignoreFaces.set(i);
                }
            }
      
        NEW:
      
            if (isA<processorPolyPatch>(pp))
            {
                ignoreFaces.set(pp.range());
            }
      bac943e6
  10. 01 Feb, 2017 1 commit
  11. 30 Nov, 2016 1 commit
  12. 29 Nov, 2016 1 commit
    • Mark Olesen's avatar
      ENH: change from triSurface to meshedSurface storage for iso-surfaces · 3c41b80b
      Mark Olesen authored
      - this makes it easier to reuse the code, and sampledSurface expect
        a face (not a labelledFace), so this also eliminates a translation
        level and simplifies memory management.
      
      - before/after comparison of the sampled iso-surfaces tested with
        iso-surfaces from interFoam/RAS/angledDuct tutorial (serial and
        parallel)
      3c41b80b
  13. 24 Nov, 2016 1 commit
  14. 23 Sep, 2016 1 commit
  15. 25 Apr, 2016 2 commits
  16. 12 Mar, 2016 1 commit
  17. 29 Feb, 2016 1 commit
  18. 10 Jan, 2016 1 commit
  19. 26 Nov, 2015 1 commit
  20. 21 Feb, 2013 2 commits
  21. 17 Apr, 2012 2 commits
  22. 14 Aug, 2011 1 commit
  23. 19 Jan, 2011 1 commit
  24. 14 Jan, 2011 1 commit
  25. 07 Jan, 2011 1 commit
  26. 05 Jan, 2011 2 commits
  27. 28 Jul, 2010 1 commit
  28. 29 Mar, 2010 1 commit
  29. 20 Mar, 2009 1 commit
  30. 12 Mar, 2009 1 commit
  31. 10 Mar, 2009 1 commit
  32. 26 Feb, 2009 1 commit
  33. 24 Feb, 2009 1 commit
  34. 21 Jan, 2009 1 commit
  35. 17 Jan, 2009 1 commit
  36. 31 Dec, 2008 1 commit