|
| struct | AllSemanticLabel |
| |
| struct | AllSemanticTag |
| |
| struct | Alpha |
| |
| struct | AlphaInterval |
| |
| struct | And |
| |
| struct | AnySemanticLabel |
| |
| struct | AnySemanticTag |
| |
| struct | Bool |
| |
| struct | Boolean |
| |
| struct | ChildOf |
| |
| struct | ColorMap |
| |
| struct | ContainOccupancyState |
| |
| struct | ContainOccupancyStates |
| |
| struct | Contains |
| |
| struct | ContainsVoidRegion |
| |
| struct | Cost |
| |
| struct | CostInterval |
| |
| struct | Count |
| |
| struct | CountInterval |
| |
| struct | CountMap |
| |
| struct | Disjoint |
| |
| struct | Exists |
| |
| struct | Filter |
| |
| struct | Filter< And< Preds... > > |
| |
| struct | Filter< Bool > |
| |
| struct | Filter< Boolean< Negated > > |
| |
| struct | Filter< ChildOf< Dim, Negated > > |
| |
| struct | Filter< ContainOccupancyState< State > > |
| |
| struct | Filter< ContainOccupancyStates > |
| |
| struct | Filter< Contains< Geometry, Negated > > |
| |
| struct | Filter< ContainsVoidRegion< Negated > > |
| |
| struct | Filter< Coord< Axis, Negated > > |
| |
| struct | Filter< Cost< PC > > |
| |
| struct | Filter< CostInterval< Negated > > |
| |
| struct | Filter< Depth< Negated > > |
| |
| struct | Filter< Disjoint< Geometry > > |
| |
| struct | Filter< Exists< Negated > > |
| |
| struct | Filter< HasLabel< Negated > > |
| |
| struct | Filter< Height< Negated > > |
| |
| struct | Filter< Iff< PredLeft, PredRight > > |
| |
| struct | Filter< IfThen< PredPre, PredPost > > |
| |
| struct | Filter< Inner > |
| |
| struct | Filter< Inside< Geometry, Negated > > |
| |
| struct | Filter< Intersects< Geometry > > |
| |
| struct | Filter< Label< Negated > > |
| |
| struct | Filter< Leaf > |
| |
| struct | Filter< Length< Negated > > |
| |
| struct | Filter< Modified< Negated > > |
| |
| struct | Filter< Occupancy< PC > > |
| |
| struct | Filter< OccupancyInterval< Negated > > |
| |
| struct | Filter< OccupancyState< State, Negated > > |
| |
| struct | Filter< OccupancyStates > |
| |
| struct | Filter< Offset< Negated > > |
| |
| struct | Filter< Or< Preds... > > |
| |
| struct | Filter< Parent > |
| |
| struct | Filter< Predicate< Tree > > |
| |
| struct | Filter< PureLeaf > |
| |
| struct | Filter< Satisfies< ReturnFun, TraverseFun, Negated > > |
| |
| struct | Filter< VoidRegion< Negated > > |
| |
| struct | Filter< Xor< PredLeft, PredRight > > |
| |
| struct | HasColor |
| |
| struct | HasLabel |
| |
| struct | HasSurfel |
| |
| struct | Hits |
| |
| struct | HitsInterval |
| |
| struct | Iff |
| |
| struct | IfThen |
| |
| struct | Init< AlphaInterval< Negated > > |
| |
| struct | Init< ColorMap< Negated > > |
| |
| struct | Init< CountInterval< Negated > > |
| |
| struct | Init< CountMap< Negated > > |
| |
| struct | Init< HitsInterval< Negated > > |
| |
| struct | Init< IntensityInterval< Negated > > |
| |
| struct | Init< IntensityMap< Negated > > |
| |
| struct | Init< MissesInterval< Negated > > |
| |
| struct | Init< OccupancyMap< Negated > > |
| |
| struct | Init< ReflectionMap< Negated > > |
| |
| struct | Init< ReflectivenessInterval< Negated > > |
| |
| struct | Init< TimeInterval< Negated > > |
| |
| struct | Init< TimeMap< Negated > > |
| |
| struct | Inner |
| |
| struct | InnerCheck< AllSemanticLabel< Negated > > |
| |
| struct | InnerCheck< AllSemanticTag< Negated > > |
| |
| struct | InnerCheck< Alpha< PC > > |
| |
| struct | InnerCheck< AlphaInterval< Negated > > |
| |
| struct | InnerCheck< AnySemanticLabel< Negated > > |
| |
| struct | InnerCheck< AnySemanticTag< Negated > > |
| |
| struct | InnerCheck< ColorMap< Negated > > |
| |
| struct | InnerCheck< Count< PC > > |
| |
| struct | InnerCheck< CountInterval< Negated > > |
| |
| struct | InnerCheck< CountMap< Negated > > |
| |
| struct | InnerCheck< HasColor< Negated > > |
| |
| struct | InnerCheck< HasSurfel< Negated > > |
| |
| struct | InnerCheck< Hits< PC > > |
| |
| struct | InnerCheck< HitsInterval< Negated > > |
| |
| struct | InnerCheck< Intensity< PC > > |
| |
| struct | InnerCheck< IntensityInterval< Negated > > |
| |
| struct | InnerCheck< IntensityMap< Negated > > |
| |
| struct | InnerCheck< Misses< PC > > |
| |
| struct | InnerCheck< MissesInterval< Negated > > |
| |
| struct | InnerCheck< NoneSemanticLabel< Negated > > |
| |
| struct | InnerCheck< NoneSemanticTag< Negated > > |
| |
| struct | InnerCheck< NumSurfelPoints< PC > > |
| |
| struct | InnerCheck< NumSurfelPointsInterval > |
| |
| struct | InnerCheck< OccupancyMap< Negated > > |
| |
| struct | InnerCheck< ReflectionMap< Negated > > |
| |
| struct | InnerCheck< Reflectiveness< PC > > |
| |
| struct | InnerCheck< ReflectivenessInterval< Negated > > |
| |
| struct | InnerCheck< SemanticSetLabel< Negated > > |
| |
| struct | InnerCheck< SemanticSetMap > |
| |
| struct | InnerCheck< SurfelMap > |
| |
| struct | InnerCheck< SurfelPlanarity< PC > > |
| |
| struct | InnerCheck< SurfelPlanarityInterval > |
| |
| struct | InnerCheck< Then< ColorMap< Negated >, PredPost > > |
| |
| struct | InnerCheck< Then< CountMap< Negated >, PredPost > > |
| |
| struct | InnerCheck< Then< IntensityMap< Negated >, PredPost > > |
| |
| struct | InnerCheck< Then< OccupancyMap< Negated >, PredPost > > |
| |
| struct | InnerCheck< Then< ReflectionMap< Negated >, PredPost > > |
| |
| struct | InnerCheck< Then< SemanticSetMap, PredPost > > |
| |
| struct | InnerCheck< Then< SurfelMap, PredPost > > |
| |
| struct | InnerCheck< Then< TimeMap< Negated >, PredPost > > |
| |
| struct | InnerCheck< Time< PC > > |
| |
| struct | InnerCheck< TimeInterval< Negated > > |
| |
| struct | InnerCheck< TimeMap< Negated > > |
| |
| struct | Inside |
| |
| struct | Intensity |
| |
| struct | IntensityInterval |
| |
| struct | IntensityMap |
| |
| struct | Intersects |
| |
| struct | is_spatial_pred |
| |
| struct | Label |
| |
| struct | Leaf |
| |
| struct | Misses |
| |
| struct | MissesInterval |
| |
| struct | Modified |
| |
| struct | NoneSemanticLabel |
| |
| struct | NoneSemanticTag |
| |
| struct | NumSurfelPoints |
| |
| struct | NumSurfelPointsInterval |
| |
| struct | Occupancy |
| |
| struct | OccupancyInterval |
| |
| struct | OccupancyMap |
| |
| struct | OccupancyState |
| |
| struct | OccupancyStates |
| |
| struct | Offset |
| |
| struct | Or |
| |
| struct | Parent |
| |
| class | Predicate |
| |
| struct | predicate_map_type |
| |
| struct | PredicateInterval |
| |
| struct | PureLeaf |
| |
| struct | ReflectionMap |
| |
| struct | Reflectiveness |
| |
| struct | ReflectivenessInterval |
| |
| struct | Satisfies |
| |
| struct | SatisfiesDefaultReturnFun |
| |
| struct | SatisfiesDefaultTraverseFun |
| |
| struct | SemanticEmpty |
| |
| struct | SemanticSetLabel |
| |
| struct | SemanticSetMap |
| |
| struct | SurfelMap |
| |
| struct | SurfelPlanarity |
| |
| struct | SurfelPlanarityInterval |
| |
| struct | Time |
| |
| struct | TimeInterval |
| |
| struct | TimeMap |
| |
| struct | ValueCheck< AllSemanticLabel< Negated > > |
| |
| struct | ValueCheck< AllSemanticTag< Negated > > |
| |
| struct | ValueCheck< Alpha< PC > > |
| |
| struct | ValueCheck< AlphaInterval< Negated > > |
| |
| struct | ValueCheck< AnySemanticLabel< Negated > > |
| |
| struct | ValueCheck< AnySemanticTag< Negated > > |
| |
| struct | ValueCheck< ColorMap< Negated > > |
| |
| struct | ValueCheck< Count< PC > > |
| |
| struct | ValueCheck< CountInterval< Negated > > |
| |
| struct | ValueCheck< CountMap< Negated > > |
| |
| struct | ValueCheck< HasColor< Negated > > |
| |
| struct | ValueCheck< HasSurfel< Negated > > |
| |
| struct | ValueCheck< Hits< PC > > |
| |
| struct | ValueCheck< HitsInterval< Negated > > |
| |
| struct | ValueCheck< Intensity< PC > > |
| |
| struct | ValueCheck< IntensityInterval< Negated > > |
| |
| struct | ValueCheck< IntensityMap< Negated > > |
| |
| struct | ValueCheck< Misses< PC > > |
| |
| struct | ValueCheck< MissesInterval< Negated > > |
| |
| struct | ValueCheck< NoneSemanticLabel< Negated > > |
| |
| struct | ValueCheck< NoneSemanticTag< Negated > > |
| |
| struct | ValueCheck< NumSurfelPoints< PC > > |
| |
| struct | ValueCheck< NumSurfelPointsInterval > |
| |
| struct | ValueCheck< OccupancyMap< Negated > > |
| |
| struct | ValueCheck< ReflectionMap< Negated > > |
| |
| struct | ValueCheck< Reflectiveness< PC > > |
| |
| struct | ValueCheck< ReflectivenessInterval< Negated > > |
| |
| struct | ValueCheck< SemanticSetLabel< Negated > > |
| |
| struct | ValueCheck< SemanticSetMap > |
| |
| struct | ValueCheck< SurfelMap > |
| |
| struct | ValueCheck< SurfelPlanarity< PC > > |
| |
| struct | ValueCheck< SurfelPlanarityInterval > |
| |
| struct | ValueCheck< Then< ColorMap< Negated >, PredPost > > |
| |
| struct | ValueCheck< Then< CountMap< Negated >, PredPost > > |
| |
| struct | ValueCheck< Then< IntensityMap< Negated >, PredPost > > |
| |
| struct | ValueCheck< Then< OccupancyMap< Negated >, PredPost > > |
| |
| struct | ValueCheck< Then< ReflectionMap< Negated >, PredPost > > |
| |
| struct | ValueCheck< Then< SemanticSetMap, PredPost > > |
| |
| struct | ValueCheck< Then< SurfelMap, PredPost > > |
| |
| struct | ValueCheck< Then< TimeMap< Negated >, PredPost > > |
| |
| struct | ValueCheck< Time< PC > > |
| |
| struct | ValueCheck< TimeInterval< Negated > > |
| |
| struct | ValueCheck< TimeMap< Negated > > |
| |
| struct | VoidRegion |
| |
| struct | Xor |
| |
|
|
template<std::size_t Dim> |
| | ChildOf (TreeCode< Dim >) -> ChildOf< Dim > |
| |
| template<bool Negated> |
| constexpr AllSemanticLabel<!Negated > | operator! (AllSemanticLabel< Negated > p) |
| |
| template<bool Negated> |
| constexpr AllSemanticTag<!Negated > | operator! (AllSemanticTag< Negated > p) |
| |
| template<bool Negated> |
| AlphaInterval<!Negated > | operator! (AlphaInterval< Negated > p) |
| |
| template<Filterable... Preds> |
| constexpr auto | operator! (And< Preds... > const &p) noexcept |
| |
| template<bool Negated> |
| constexpr AnySemanticLabel<!Negated > | operator! (AnySemanticLabel< Negated > p) |
| |
| template<bool Negated> |
| constexpr AnySemanticTag<!Negated > | operator! (AnySemanticTag< Negated > p) |
| |
| constexpr Bool | operator! (Bool const &p) noexcept |
| |
| template<bool Negated> |
| constexpr Boolean<!Negated > | operator! (Boolean< Negated > const &) noexcept |
| |
| template<std::size_t Dim, bool Negated> |
| constexpr ChildOf< Dim, !Negated > | operator! (ChildOf< Dim, Negated > const &p) noexcept |
| |
| template<class Geometry , bool Negated> |
| constexpr Contains< Geometry, !Negated > | operator! (Contains< Geometry, Negated > const &p) noexcept |
| |
| template<bool Negated> |
| constexpr ContainsVoidRegion<!Negated > | operator! (ContainsVoidRegion< Negated >) noexcept |
| |
| template<bool Negated> |
| CostInterval<!Negated > | operator! (CostInterval< Negated > p) |
| |
| template<bool Negated> |
| CountInterval<!Negated > | operator! (CountInterval< Negated > p) |
| |
| template<bool Negated> |
| CountMap<!Negated > | operator! (CountMap< Negated >) |
| |
| template<class Geometry > |
| constexpr Intersects< Geometry > | operator! (Disjoint< Geometry > const &p) noexcept |
| |
| template<bool Negated> |
| constexpr Exists<!Negated > | operator! (Exists< Negated > const &) noexcept |
| |
| template<bool Negated> |
| HasColor<!Negated > | operator! (HasColor< Negated >) |
| |
| template<bool Negated> |
| HasLabel<!Negated > | operator! (HasLabel< Negated >) |
| |
| template<bool Negated> |
| constexpr HasSurfel<!Negated > | operator! (HasSurfel< Negated > const &p) |
| |
| template<bool Negated> |
| HitsInterval<!Negated > | operator! (HitsInterval< Negated > p) |
| |
| template<Filterable PredLeft, Filterable PredRight> |
| constexpr Xor< PredLeft, PredRight > | operator! (Iff< PredLeft, PredRight > const &p) noexcept |
| |
| template<Filterable PredPre, Filterable PredPost> |
| constexpr auto | operator! (IfThen< PredPre, PredPost > const &p) noexcept |
| |
| constexpr PureLeaf | operator! (Inner) noexcept |
| |
| template<class Geometry , bool Negated> |
| constexpr Inside< Geometry, !Negated > | operator! (Inside< Geometry, Negated > const &p) noexcept |
| |
| template<bool Negated> |
| IntensityInterval<!Negated > | operator! (IntensityInterval< Negated > p) |
| |
| template<bool Negated> |
| IntensityMap<!Negated > | operator! (IntensityMap< Negated >) |
| |
| template<class Geometry > |
| constexpr Disjoint< Geometry > | operator! (Intersects< Geometry > const &p) noexcept |
| |
| template<bool Negated> |
| Label<!Negated > | operator! (Label< Negated >) |
| |
| constexpr Parent | operator! (Leaf) noexcept |
| |
| template<bool Negated> |
| MissesInterval<!Negated > | operator! (MissesInterval< Negated > p) |
| |
| template<bool Negated> |
| constexpr Modified<!Negated > | operator! (Modified< Negated > const &) noexcept |
| |
| template<bool Negated> |
| constexpr NoneSemanticLabel<!Negated > | operator! (NoneSemanticLabel< Negated > p) |
| |
| template<bool Negated> |
| constexpr NoneSemanticTag<!Negated > | operator! (NoneSemanticTag< Negated > p) |
| |
| template<bool Negated> |
| OccupancyInterval<!Negated > | operator! (OccupancyInterval< Negated > p) |
| |
| template<bool Negated> |
| OccupancyMap<!Negated > | operator! (OccupancyMap< Negated >) |
| |
| template<ufo::OccupancyState State, bool Negated> |
| constexpr OccupancyState< State, !Negated > | operator! (OccupancyState< State, Negated > const &) |
| |
| template<bool Negated> |
| Offset<!Negated > | operator! (Offset< Negated > const &p) |
| |
| template<Filterable... Preds> |
| constexpr auto | operator! (Or< Preds... > const &p) noexcept |
| |
| constexpr Leaf | operator! (Parent) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, !Negated > | operator! (PredicateInterval< T, Negated > const &p) noexcept |
| |
| constexpr Inner | operator! (PureLeaf) noexcept |
| |
| template<bool Negated> |
| ReflectionMap<!Negated > | operator! (ReflectionMap< Negated >) |
| |
| template<bool Negated> |
| ReflectivenessInterval<!Negated > | operator! (ReflectivenessInterval< Negated > p) |
| |
| template<class ReturnFun , class TraverseFun , bool Negated> |
| constexpr Satisfies< ReturnFun, TraverseFun, !Negated > | operator! (Satisfies< ReturnFun, TraverseFun, Negated > const &p) noexcept |
| |
| template<bool Negated> |
| constexpr SemanticSetLabel<!Negated > | operator! (SemanticSetLabel< Negated > p) |
| |
| template<bool Negated> |
| TimeInterval<!Negated > | operator! (TimeInterval< Negated > p) |
| |
| template<bool Negated> |
| TimeMap<!Negated > | operator! (TimeMap< Negated >) |
| |
| template<bool Negated> |
| constexpr VoidRegion<!Negated > | operator! (VoidRegion< Negated >) noexcept |
| |
| template<Filterable PredLeft, Filterable PredRight> |
| constexpr Iff< PredLeft, PredRight > | operator! (Xor< PredLeft, PredRight > const &p) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, true > | operator!= (PredicateInterval< T, Negated > const &p, typename T::value_type const &v) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, true > | operator!= (typename T::value_type const &v, PredicateInterval< T, Negated > const &p) noexcept |
| |
| template<Filterable PredLeft, Filterable PredRight> |
| constexpr auto | operator&& (PredLeft &&p1, PredRight &&p2) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator< (PredicateInterval< T, Negated > const &p, typename T::value_type const &v) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator< (typename T::value_type const &v, PredicateInterval< T, Negated > const &p) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator<= (PredicateInterval< T, Negated > const &p, typename T::value_type const &v) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator<= (typename T::value_type const &v, PredicateInterval< T, Negated > const &p) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator== (PredicateInterval< T, Negated > const &p, typename T::value_type const &v) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator== (typename T::value_type const &v, PredicateInterval< T, Negated > const &p) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator> (PredicateInterval< T, Negated > const &p, typename T::value_type const &v) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator> (typename T::value_type const &v, PredicateInterval< T, Negated > const &p) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator>= (PredicateInterval< T, Negated > const &p, typename T::value_type const &v) noexcept |
| |
| template<class T , bool Negated> |
| constexpr PredicateInterval< T, Negated > | operator>= (typename T::value_type const &v, PredicateInterval< T, Negated > const &p) noexcept |
| |
| template<Filterable PredPre, Filterable PredPost> |
| constexpr IfThen< std::remove_cvref_t< PredPre >, std::remove_cvref_t< PredPost > > | operator>> (PredPre &&pre, PredPost &&post) noexcept |
| |
| template<Filterable PredLeft, Filterable PredRight> |
| constexpr Xor< std::remove_cvref_t< PredLeft >, std::remove_cvref_t< PredRight > > | operator^ (PredLeft &&left, PredRight &&right) noexcept |
| |
| template<Filterable PredLeft, Filterable PredRight> |
| constexpr auto | operator|| (PredLeft &&p1, PredRight &&p2) noexcept |
| |
UFOMap: An Efficient Probabilistic 3D Mapping Framework That Embraces the Unknown
- Author
- Daniel Duberg (ddube.nosp@m.rg@k.nosp@m.th.se)
- See also
- https://github.com/UnknownFreeOccupied/ufomap
- Version
- 1.0
- Date
- 2022-05-13
- Copyright
- Copyright (c) 2022, Daniel Duberg, KTH Royal Institute of Technology
BSD 3-Clause License
Copyright (c) 2022, Daniel Duberg, KTH Royal Institute of Technology All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
- Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
UFOTree: An Efficient Probabilistic 3D Treeping Framework That Embraces the Unknown
- Author
- Daniel Duberg (ddube.nosp@m.rg@k.nosp@m.th.se)
- See also
- https://github.com/UnknownFreeOccupied/ufomap
- Version
- 1.0
- Date
- 2022-05-13
- Copyright
- Copyright (c) 2022, Daniel Duberg, KTH Royal Institute of Technology
BSD 3-Clause License
Copyright (c) 2022, Daniel Duberg, KTH Royal Institute of Technology All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
- Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
UFOMap: An Efficient Probabilistic 3D Mapping Framework That Embraces the Unknown
- Author
- Daniel Duberg (ddube.nosp@m.rg@k.nosp@m.th.se), Ramona Häuselmann (ramon.nosp@m.aha@.nosp@m.kth.s.nosp@m.e)
- See also
- https://github.com/UnknownFreeOccupied/ufomap
- Version
- 1.0
- Date
- 2022-05-13
- Copyright
- Copyright (c) 2022, Daniel Duberg, KTH Royal Institute of Technology
BSD 3-Clause License
Copyright (c) 2022, Daniel Duberg, KTH Royal Institute of Technology All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
- Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.