-
There is a large compute overhead for evaluating shape where clauses.
What are the performance numbers we're looking into?
The shape matching algorithm should be able to evaluate a single operati…
-
- [ ] non matching guids
- [ ] non-circular shapes
- [ ] empty shapes
- [ ] non-matching years
-
We should implement some algorithms that allows to find the best matching shape in a mask.
The shape could be square, rectangle, ellipse or circle and it should have the same number of points that …
-
The basis for this was laid in #49, which added a function called `verify_shape` to verify the shapes of lists.
As of now, `verify_shapes` is capable of recursively checking the lengths and element t…
-
When the shapes "nearly" fit, artifacts are created on the intersection.
For example when attaching skegs to a hull:
-
# Problem
03-training-formalization.ipynb
```
ValueError: A `Concatenate` layer requires inputs with matching shapes except for the concatenation axis. Received: input_shape=[(None, 2), (None, 4)…
-
**Feature description.**
At present, when selecting the legend patch shape for a point layer, you can only select legend patches that are composed of points. This also applies when manually typing a …
-
Currently the replication publication gets altered when a shape is created (adds a table and potentially a row filter) but no cleanup occurs - so the publication can potentially grow to include everyt…
-
GTFS allows to publish shapes as it is an abstract thing. Technically it is even possible to share shapes between trips that do not have the same stop sequence, but follow the same route-over-the-road…
-
### System Info
OH transformers_future branch
### Information
- [ ] The official example scripts
- [ ] My own modified scripts
### Tasks
- [ ] An officially supported task in the `ex…