update non planar image

docs/de/R_GE_P_NON_PLANAR.md

@@ -13,6 +13,9 @@
 Normalen Abweichung:   
 ![normalDeviation](img/normalDeviation.png)
 
+Distanz eines Punktes zur Regressionsebene:   
+![nonPlanarDistance](img/nonPlanarDistance.png)
+
 
 ## Prüfung
 

docs/en/R_GE_P_NON_PLANAR.md

@@ -13,6 +13,9 @@
 Normal deviation:   
 ![normalDeviation](img/normalDeviation.png)
 
+Distance of a point to the regression plane:   
+![nonPlanarDistance](img/nonPlanarDistance.png)
+
 
 ## Check
 

public/de/R_GE_P_NON_PLANAR/index.html

@@ -470,6 +470,8 @@
 </table>
 <p>Normalen Abweichung: <br/>
 <img alt="normalDeviation" src="../img/normalDeviation.png"/></p>
+<p>Distanz eines Punktes zur Regressionsebene: <br/>
+<img alt="nonPlanarDistance" src="../img/nonPlanarDistance.png"/></p>
 <h2 id="prufung">Prüfung<a class="headerlink" href="#prufung" title="Permanent link">#</a></h2>
 <table>
 <thead>

public/de/search/search_index.json

-{"config":{"lang":["de"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"CityDoctor","text":"<p>Software zur Pr\u00fcfung und automatisierten Reparatur virtueller Stadtmodelle </p> <p>CityDoctor2 ist eine Qualit\u00e4tspr\u00fcfungssoftware f\u00fcr 3D Stadtmodelle im CityGML format. CityDoctor kann CityGML 1/2 Dokumente einlesen und seit Version 3.12 kann auch eingeschr\u00e4nkt CityGML 3 gelesen werden. Alle Pr\u00fcfergebnisse k\u00f6nnen in xml oder pdf Form ausgegeben werden. Zus\u00e4tzlich implementiert CityDoctor die QualityADE um Pr\u00fcfergebnisse direkt in CityGML zu speichern.</p> <p></p>"},{"location":"#lizenzen-versionen","title":"Lizenzen / Versionen","text":""},{"location":"#citydoctorvalidation","title":"CityDoctorValidation","text":"<p>Der Validierungsteil von CityDoctor ist frei verf\u00fcgbar und OpenSource</p>"},{"location":"#citydoctorgui","title":"CityDoctorGUI","text":"<p>Die grafische Oberfl\u00e4che ist frei verf\u00fcgbar und OpenSource</p>"},{"location":"#citydoctorhealer","title":"CityDoctorHealer","text":"<p>Der Teil zust\u00e4ndig f\u00fcr die Reparatur frei verf\u00fcgbar und OpenSource Die Reparatur funktioniert nur prototypisch und hat keine Garantie, dass jeder Fehler behoben werden kann oder es \u00fcberhaupt eine Verbesserung gibt.</p> <p>Bei Fragen Mail an:  </p>"},{"location":"#projekte","title":"Projekte","text":"<p>CityDoctor wurde in mehreren Projekten entwickelt. Momentan wird CityDoctor im Rahmen des Projekts UDigitDoctor entwickelt.</p> <p>Vergangenes Projekt:</p> <ul> <li>CityDoctor2</li> </ul>"},{"location":"R_GE_MS/","title":"R_GE_MS","text":""},{"location":"R_GE_MS/#anforderung","title":"Anforderung","text":"ID R_GE_MS Beschreibung Ein MultiSurface ist eine Sammlung von Polygonen ohne weitere Einschr\u00e4nkungen. Ein MultiSurface ist nur g\u00fcltig, wenn alle Polygone g\u00fcltig sind. Die Anforderungen R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_R_TOO_FEW_POINTS, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME m\u00fcssen erf\u00fcllt werden Fehlercode --"},{"location":"R_GE_MS/#prufung","title":"Pr\u00fcfung","text":"<p>Keine weiteren Pr\u00fcfungen notwendig. Die einzelnen Anforderungen haben eigene Pr\u00fcfungen f\u00fcr ihre Erf\u00fcllung.</p>"},{"location":"R_GE_MS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis <p>Existierende Testf\u00e4lle k\u00f6nnen verwendet werden. </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/","title":"R_GE_P_HOLE_OUTSIDE","text":""},{"location":"R_GE_P_HOLE_OUTSIDE/#anforderung","title":"Anforderung","text":"ID R_GE_P_HOLE_OUTSIDE Beschreibung Innerer Ring darf nicht komplett au\u00dferhalb des \u00e4u\u00dferen Rings sein. Fehlercode GE_P_HOLE_OUTSIDE <p>Beispiel:  </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_HOLE_OUTSIDE Anforderungs ID R_GE_P_HOLE_OUTSIDE Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Beschreibung Fehlercode GE_P_HOLE_OUTSIDE"},{"location":"R_GE_P_HOLE_OUTSIDE/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0004-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0004-T0002 SimpleSolid_SrefBS-GE-gml-PO-0004-T0001.gml GE_P_HOLE_OUTSIDE in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INNER_RINGS_NESTED/","title":"R_GE_P_INNER_RINGS_NESTED","text":""},{"location":"R_GE_P_INNER_RINGS_NESTED/#anforderung","title":"Anforderung","text":"ID R_GE_P_INNER_RINGS_NESTED Beschreibung Innere Ringe d\u00fcrfen nicht innerhalb eines anderen inneren Rings sein. Fehlercode GE_P_INNER_RINGS_NESTED <p>Beispiel:  </p>"},{"location":"R_GE_P_INNER_RINGS_NESTED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_INNER_RINGS_NESTED Anforderungs ID R_GE_P_INNER_RINGS_NESTED Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Beschreibung Fehlercode GE_P_INNER_RINGS_NESTED"},{"location":"R_GE_P_INNER_RINGS_NESTED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0005-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0005-T0002 SimpleSolid_SrefBS-GE-gml-PO-0005-T0001.gml GE_P_INNER_RINGS_NESTED in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/","title":"R_GE_P_INTERIOR_DISCONNECTED","text":""},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#anforderung","title":"Anforderung","text":"ID R_GE_P_INTERIOR_DISCONNECTED Beschreibung Die innere Fl\u00e4che eines Polygons muss verbunden sein. Parameter minVertexDistance Ein Punkt ber\u00fchrt eine Kante, wenn der Abstand kleiner als minVertexDistance ist, siehe Vertex Anforderungen Fehlercode GE_P_INTERIOR_DISCONNECTED <p>Beispiele:  </p> <p></p>"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_INTERIOR_DISCONNECTED Anforderungs ID R_GE_P_INTERIOR_DISCONNECTED Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, GE_P_ORIENTATION_RINGS_SAME Beschreibung Fehlercode GE_P_INTERIOR_DISCONNECTED"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0003-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0003-T0002 SimpleSolid_SrefBS-GE-gml-PO-0003-T0001.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0003-T0003 SimpleSolid_SrefBS-GE-gml-PO-0003-T0002.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERSECTING_RINGS/","title":"R_GE_P_INTERSECTING_RINGS","text":""},{"location":"R_GE_P_INTERSECTING_RINGS/#anforderung","title":"Anforderung","text":"ID R_GE_P_INTERSECTING_RINGS Beschreibung \u00c4u\u00dferer und innere Ringe d\u00fcrfen sich nicht verschneiden Parameter minVertexDistance Zwei Ringe verschneiden sich nicht, wenn nur ein Punkt des einen Rings den Anderen ber\u00fchrt. Ein Punkt ber\u00fchrt eine Kante nur dann wenn der Abstand weniger als minVertexDistance ist. Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_P_INTERSECTING_RINGS <p>Beispiele:</p> <p>\u00c4u\u00dferer Ring verschneidet inneren Ring: </p> <p>Zwei innere Ringe verschneiden sich: </p>"},{"location":"R_GE_P_INTERSECTING_RINGS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_INTERSECTING_RINGS Anforderungs ID R_GE_P_INTERSECTING_RINGS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME Beschreibung Wenn ein Punkt eines inneren Rings au\u00dferhalb des \u00e4u\u00dferen ist oder innerhalb eines anderen inneren Rings, ist das eine Verschneidung. Fehlercode GE_P_INTERSECTING_RINGS"},{"location":"R_GE_P_INTERSECTING_RINGS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0001-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0001.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0001-T0002 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0001-T0003 SimpleSolid_SrefBS-GE-gml-PO-0001-T0003.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_NON_PLANAR/","title":"R_GE_P_NON_PLANAR","text":""},{"location":"R_GE_P_NON_PLANAR/#anforderung","title":"Anforderung","text":"ID R_GE_P_NON_PLANAR Beschreibung Jedes Polygon muss planar sein. Planarit\u00e4t ist erreicht, wenn kein Punkt weiter als distanceTolerance von der Regressionsebene aller Punkte entfernt ist, sowie die Normalen jedes Dreiecks des tessellierten Polygons keine gr\u00f6\u00dfere Winkelabweichung als angleTolerance haben. Parameter 1:   type Der Typ der Planarit\u00e4tspr\u00fcfung kann ausgew\u00e4hlt werden. Muss eins von distance, angle, both sein.<ul><li>Wenn der Parameter distance ist: Nur die Distanzpr\u00fcfung wird ausgef\u00fchrt.</li><li> Wenn der Parameter angle ist: Nur die Normalenabweichungspr\u00fcfung wird ausgef\u00fchrt.</li><li>Wenn der Parameter both ist: Beide Pr\u00fcfungen werden ausgef\u00fchrt.</li></ul> Parameter 2:   distanceTolerance Toleranz der Distanz eines Punktes von der Regressionsebene Parameter 3:   angleTolerance Toleranz des Winkels der Dreiecksnormalen Fehlercodes GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION <p>Normalen Abweichung:  </p>"},{"location":"R_GE_P_NON_PLANAR/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_NON_PLANAR Anforderungs ID R_GE_P_NON_PLANAR Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL Beschreibung Um die Normalenabweichung zu bestimmen, werden alle Polygone tesselliert, um die Dreiecksnormalen zu berechnen, deren Winkel f\u00fcr den Vergleich verwendet werden. Die Tessellierung der Polygone ist nicht eindeutig und damit ist das Ergebnis der Pr\u00fcfung der Normalenabweichung nicht eindeutig. F\u00fcr die Distanzpr\u00fcfung wird eine Regressionsebene aus allen Polygonpunkten erstellt, um den Abstand der Punkte zu dieser Ebene zu berechnen. Fehlercode GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION"},{"location":"R_GE_P_NON_PLANAR/#implementierung","title":"Implementierung","text":"<p>In CityDoctor2 ist nur die Abstandspr\u00fcfung standardm\u00e4\u00dfig aktiv, da die Normalenpr\u00fcfung keine deterministischen Ergebnisse liefert.</p>"},{"location":"R_GE_P_NON_PLANAR/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0002-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0002-T0002 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE in _Simple_BD.1_PG.2 mit distanceTolerance = 0.01 GE-gml:PO-0002-T0003 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml OK f\u00fcr diese Anforderung mit distanceTolerance = 0.5, GE_P_ORIENTATION_RINGS_SAME in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0002-T0004 SimpleSolid_SrefBS-GE-gml-PO-0002-T0002.gml GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION in _Simple_BD.1_PG.1 mit Parameter type = angle"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/","title":"R_GE_P_ORIENTATION_RINGS_SAME","text":""},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#anforderung","title":"Anforderung","text":"ID R_GE_P_ORIENTATION_RINGS_SAME Beschreibung \u00c4u\u00dfere und innere Ringe d\u00fcrfen nicht die selbe Orientierung haben. Fehlercode GE_P_ORIENTATION_RINGS_SAME <p>Beispiel :  </p>"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_ORIENTATION_RINGS_SAME Anforderungs ID R_GE_P_ORIENTATION_RINGS_SAME Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR Beschreibung Fehlercode GE_P_ORIENTATION_RINGS_SAME"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0006-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK GE-gml:PO-0006-T0002 SimpleSolid_SrefBS-GE-gml-PO-0006-T0001.gml GE_P_ORIENTATION_RINGS_SAME in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_R_COLLAPSED_TO_LINE/","title":"R_GE_R_COLLAPSED_TO_LINE","text":""},{"location":"R_GE_R_COLLAPSED_TO_LINE/#anforderung","title":"Anforderung","text":"ID R_GE_R_COLLAPSED_TO_LINE Beschreibung Ein Spezialfall von Selbstverschneidung (GE_R_SELF_INTERSECTION): Der Ring ist eine Linie. Wenn der Ring einen Punkt darstellt, dann wird dies durch die Anforderungen GE_R_TOO_FEW_POINTS / GE_R_CONSECUTIVE_POINTS_SAME gepr\u00fcft ob es sich hierbei um einen Fehler handelt. Fehlercode GE_R_SELF_INTERSECTION, GE_R_COLLAPSED_TO_LINE, GE_R_TOO_FEW_POINTS, GE_R_CONSECUTIVE_POINTS_SAME"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_COLLAPSED_TO_LINE Anforderungs ID R_GE_R_COLLAPSED_TO_LINE Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Beschreibung Ring als ein Punkt kann nicht passieren, wegen den Vorbedingungen. Fehlercode GE_R_COLLAPSED_TO_LINE <p>Die Anforderung ist erf\u00fcllt mit R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED und R_GE_R_SELF_INTERSECTION und ben\u00f6tigt demnach keine eigene Implementierung.</p>"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0005-T0001 GE-gml:LR-0005-T0001.gml GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/","title":"R_GE_R_CONSECUTIVE_POINTS_SAME","text":""},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#anforderung","title":"Anforderung","text":"ID R_GE_R_CONSECUTIVE_POINTS_SAME Beschreibung Punkte innerhalb eines Rings sollen sich nicht wiederholen (ausgenommen der erste und der letzte im Fall von GML, siehe R_GE_R_NOT_CLOSED). Dieser Fehler tritt oft auf, wenn zwei Punkte an derselben Stelle sind. Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_R_CONSECUTIVE_POINTS_SAME <p>Zum Beispiel dieser Ring ist fehlerhaft:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Dieser Ring ist auch Fehlerhaft mit dem Parameter minVertexDistance = 0.1</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.05 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Das n\u00e4chste Beispiel zeigt einen fehlerhaften Ring mit einem Punkt, der zwei mal vorkommt aber die Wiederholung nicht aufeinanderfolgend ist. Dies resultiert in einer Selbstverschneidung, dies ist mit dieser Anforderung nicht abgedeckt.</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_CONSECUTIVE_POINTS_SAME Anforderungs ID R_GE_R_CONSECUTIVE_POINTS_SAME Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Beschreibung Pr\u00fcft ob sich ein Punkt wiederholt Fehlercode GE_R_CONSECUTIVE_POINTS_SAME ID C_GE_R_DUPLICATE_POINT Anforderungs ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (teilweise) Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Beschreibung Erkennt aufeinanderfolgende als auch andere wiederholende Punkte. Fehlercode GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0002-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0001.gml GE_R_CONSECUTIVE_POINTS_SAME in Ring:_Simple_BD.1_PG.6_LR.1 GE-gml:LR-0002-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml OK nach dieser Anforderung, aber hat Fehler GE_R_SELF_INTERSECTION erkannt von C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0004 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml OK nach dieser Anforderung, aber hat Fehler GE_R_SELF_INTERSECTION erkannt von C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0005 SimpleSolid_SrefBS-GE-gml-LR-0002-T0004.gml GE_R_CONSECUTIVE_POINTS_SAME in Ring:_Simple_BD.1_PG.6_LR.1 mit Parameter minVertexDistance = 0.1, GE_S_NOT_CLOSED Fehler wenn minVertexDistance = 0.01 GE-gml:LR-0002-T0006 SimpleSolid_SrefBS-GE-gml-LR-0002-T0005.gml Nicht ausgef\u00fchrt da GE_R_TOO_FEW_POINTS in Ring:_Simple_BD.1_PG.6_LR.1"},{"location":"R_GE_R_NOT_CLOSED/","title":"R_GE_R_NOT_CLOSED","text":""},{"location":"R_GE_R_NOT_CLOSED/#anforderung","title":"Anforderung","text":"ID R_GE_R_NOT_CLOSED Beschreibung Der erste und letzte Punkt m\u00fcssen in GML der gleiche sein. Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_R_NOT_CLOSED <p>Zum Beispiel dieser Ring ist fehlerhaft:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>OK mit Parameter minVertexDistance = 0.1:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.05&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_NOT_CLOSED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_NOT_CLOSED Anforderungs ID R_GE_R_NOT_CLOSED Vorbedingungen R_SC_SCHEMA_VALIDATION Beschreibung Der erste und letzte Punkt innerhalb eines Rings sollen der gleiche sein. Fehlercode GE_R_NOT_CLOSED"},{"location":"R_GE_R_NOT_CLOSED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0003-T0002 SimpleSolid_SrefBS-GE-gml-LR-0003-T0001.gml GE_R_NOT_CLOSED GE-gml:LR-0003-T0003 SimpleSolid_SrefBS-GE-gml-LR-0003-T0002.gml OK mit Parameter minVertexDistance = 0.1"},{"location":"R_GE_R_SELF_INTERSECTION/","title":"R_GE_R_SELF_INTERSECTION","text":""},{"location":"R_GE_R_SELF_INTERSECTION/#anforderung","title":"Anforderung","text":"ID R_GE_R_SELF_INTERSECTION Beschreibung Ein Ring soll einfach sein, also sich nicht selbstverschneiden. Die Selbstverschneidung kann an einem konkreten Punkt sein, oder auch nicht. Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen. Dieser Parameter wird auch dazu verwendet um zu bestimmen wann ein Punkt eine Kante ber\u00fchrt. Fehlercode GE_R_SELF_INTERSECTION <p>Beispiele f\u00fcr Selbstverschneidungen:</p> <p>Schleife: </p> <p>Punkt ber\u00fchrt Kante mit Parameter minVertexDistance: </p> <p>Doppelte Punkte: </p> <p>Doppelte Kante (Gleich wie doppelte Punkte): </p>"},{"location":"R_GE_R_SELF_INTERSECTION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_SELF_INTERSECTION Anforderungs ID R_GE_R_SELF_INTERSECTION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Beschreibung Erkennt doppelte Punkte und Selbstverschneidende Kanten. Fehlercodes GE_R_SELF_INTERSECTION ID C_GE_R_DUPLICATE_POINT Anforderungs ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (teilweise) Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_NOT_CLOSED Beschreibung Erkennt wiederholende und nicht wiederholende doppelte Punkte. Letzteres ist eine Selbstverschneidung. Fehlercodes GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_SELF_INTERSECTION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0004-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0004-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml Doppelte Punkte (Beispiel, nicht representativ f\u00fcr Fehler in Modell):GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml Doppelte Punkte (resultiert in einer doppelten Kante)GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0004 SimpleSolid_SrefBS-GE-gml-LR-0004-T0004.gml Schleife (Beispiel, nicht representativ f\u00fcr Fehler in Modell): GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0005 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml Ber\u00fchrender Punkt mit Parameter minVertexDistance = 0.1: GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.2_LR.1 GE-gml:LR-0004-T0006 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml OK f\u00fcr diese Anforderung mit Parameter minVertexDistance = 0.01, GE_S_NOT_CLOSED in sp\u00e4teren Pr\u00fcfungen"},{"location":"R_GE_R_TOO_FEW_POINTS/","title":"R_GE_R_TOO_FEW_POINTS","text":""},{"location":"R_GE_R_TOO_FEW_POINTS/#anforderung","title":"Anforderung","text":"ID R_GE_R_TOO_FEW_POINTS Beschreibung Ein Ring muss mindestens 3 Punkte haben. F\u00fcr GML-Ringe ignoriert diese Anforderung die Tatsache, dass der erste und der letzte Punkt gleich sind (siehe R_GE_R_NOT_CLOSED).  Ein GML-Ring ist nach dieser Anforderung valide, wenn er mindestens 3 unterschiedliche Punkte enth\u00e4lt, aber er ist dann nicht geschlossen (die Anforderung R_GE_R_NOT_CLOSED ist nicht erf\u00fcllt). Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_R_TOO_FEW_POINTS <p>Zum Beispiel, dieser Ring ist fehlerhaft:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Valide Ringe:</p> <p>(Dieser Ring ist nicht geschlossen, hat aber genug unterschiedliche Punkte, um dieser Anforderung zu gen\u00fcgen.)</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_TOO_FEW_POINTS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_TOO_FEW_POINTS Anforderungs ID R_GE_R_TOO_FEW_POINTS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED Beschreibung Ring muss mindestens 3 unterschiedliche Punkte beinhalten Fehlercode GE_R_TOO_FEW_POINTS"},{"location":"R_GE_R_TOO_FEW_POINTS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0001-T0002 SimpleSolid_SrefBS-GE-gml-LR-0001-T0001.gml GE_R_TOO_FEW_POINTSin Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0001-T0003 SimpleSolid_SrefBS-GE-gml-LR-0001-T0002.gml Pr\u00fcfung nicht ausgef\u00fchrt da GE_R_NOT_CLOSEDRing _Simple_BD.1_PG.6_LR.1 ist nicht geschlossen, hat aber 3 Punkte."},{"location":"R_GE_SO/","title":"R_GE_SO","text":""},{"location":"R_GE_SO/#anforderung","title":"Anforderung","text":"ID R_GE_SO Beschreibung Ein Solid ist eine Sammlung von Polygonen mit Einschr\u00e4nkungen. Die Geometrie muss 'wasserdicht' sein. Siehe die Definition von Solids in Anhang A des CityGML QIE. Ein Solid ist g\u00fcltig, wenn die Anforderungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION, R_GE_S_SELF_INTERSECTION erf\u00fcllt sind. Fehlercode --"},{"location":"R_GE_SO/#prufung","title":"Pr\u00fcfung","text":"<p>keine weitere Pr\u00fcfung notwendig</p>"},{"location":"R_GE_SO/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis <p>Existierende Testf\u00e4lle der einzelnen Pr\u00fcfungen k\u00f6nnen verwendet werden.</p>"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/","title":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#anforderung","title":"Anforderung","text":"ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Beschreibung Alle Polygone haben die falsche Orientierung (definiert in GE_S_POLYGON_WRONG_ORIENTATION), so dass alle Polygone nach innen zeigen. Fehlercode GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Anforderungs ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_SELF_INTERSECTION, GE_S_POLYGON_WRONG_ORIENTATION Beschreibung Fehlercode GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0008-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0008-T0002 SimpleSolid_SrefBS-GE-gml-SO-0008-T0001.gml GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/","title":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS","text":""},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#anforderung","title":"Anforderung","text":"ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Beschreibung 1+ Polygone sind nicht mit derselben H\u00fclle verbunden. Fehlercode GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_MULTIPLE_CONNECTED_COMPONENTS Anforderungs ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Erstelle einen doppelten Graphen (Polygone werden Knoten, Polygone, die eine Kante teilen werden im Graph verbunden). Wenn der Graph nicht verbunden ist, gibt es mehrere verbundene Komponenten. Fehlercode GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0005-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0005-T0002 SimpleSolid_SrefBS-GE-gml-SO-0005-T0001.gml GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/","title":"R_GE_S_NON_MANIFOLD_EDGE","text":""},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#anforderung","title":"Anforderung","text":"ID R_GE_S_NON_MANIFOLD_EDGE Beschreibung Jede Kante sollte genau 2 Polygone begrenzen. Fehlercode GE_S_NON_MANIFOLD_EDGE Kommentar Diese Anforderung ist \u00e4hnlich zu GE_S_NOT_CLOSED: Wenn eine Kante mehr als 2 Polygone begrenzt, dann ist es ein GE_S_NON_MANIFOLD_EDGE Fehler. Wenn eine Kante nur ein Polygon begrenzt, ist es ein GE_S_NOT_CLOSED Fehler (ein Loch im Solid)"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_NON_MANIFOLD_EDGE Anforderungs ID R_GE_S_NON_MANIFOLD_EDGE Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Fehlercode GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0004-T0000 SimpleSolid_SrefBS.gml OK GE-gml:SO-0004-T0001 SimpleSolid_SrefBS-GE-gml-SO-0004-T0001.gml GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/","title":"R_GE_S_NON_MANIFOLD_VERTEX","text":""},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#anforderung","title":"Anforderung","text":"ID R_GE_S_NON_MANIFOLD_VERTEX Beschreibung Jedes Polygon das an einem Punkt eines Solids anliegt muss \u00fcber Kanten mit den anderen anliegenden Polygonen verbunden sein. Punkt und anliegende Polygone m\u00fcssen ein 'Regenschirm' erzeugen. Fehlercode GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_NON_MANIFOLD_VERTEX Anforderungs ID R_GE_S_NON_MANIFOLD_VERTEX Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Fehlercode GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0003-T0002 SimpleSolid_SrefBS-GE-gml-SO-0003-T0001.gml GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NOT_CLOSED/","title":"R_GE_S_NOT_CLOSED","text":""},{"location":"R_GE_S_NOT_CLOSED/#anforderung","title":"Anforderung","text":"ID R_GE_S_NOT_CLOSED Beschreibung Die H\u00fclle darf keine L\u00f6cher haben, sie muss Wasserdicht sein. Fehlercode GE_S_NOT_CLOSED"},{"location":"R_GE_S_NOT_CLOSED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_NOT_CLOSED Anforderungs ID R_GE_S_NOT_CLOSED Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Fehlercode GE_S_NOT_CLOSED <p>Die Pr\u00fcfung sucht alle Kanten und ordnet sie den jeweiligen Gegenkanten zu. Falls eine Kante keine Gegenkante hat so wird hier ein Loch in der H\u00fclle erkannt und ein Fehler herausgegeben.</p>"},{"location":"R_GE_S_NOT_CLOSED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0002-T0002 SimpleSolid_SrefBS-GE-gml-SO-0002-T0001.gml GE_S_NOT_CLOSED"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/","title":"R_GE_S_POLYGON_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#anforderung","title":"Anforderung","text":"ID R_GE_S_POLYGON_WRONG_ORIENTATION Beschreibung Ein Polygon muss so orientiert sein, dass die Normale des \u00e4u\u00dferen Rings nach au\u00dfen zeigt. Die Punkte sind gegen den Uhrzeigersinn angeordnet. Fehlercode GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_POLYGON_WRONG_ORIENTATION Anforderungs ID R_GE_S_POLYGON_WRONG_ORIENTATION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_EDGE Beschreibung Fehlercode GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0007-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0007-T0002 SimpleSolid_SrefBS-GE-gml-SO-0007-T0001.gml GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_SELF_INTERSECTION/","title":"R_GE_S_SELF_INTERSECTION","text":""},{"location":"R_GE_S_SELF_INTERSECTION/#anforderung","title":"Anforderung","text":"ID R_GE_S_SELF_INTERSECTION Beschreibung Der Solid darf sich nicht selbstverschneiden Fehlercode GE_S_SELF_INTERSECTION <p>Beispiel (links = OK, rechts = Fehlerhaft):  </p>"},{"location":"R_GE_S_SELF_INTERSECTION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_SELF_INTERSECTION Anforderungs ID R_GE_S_SELF_INTERSECTION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION Beschreibung Fehlercode GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_SELF_INTERSECTION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0006-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0006-T0002 SimpleSolid_SrefBS-GE-gml-SO-0006-T0001.gml GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_TOO_FEW_POLYGONS/","title":"R_GE_S_TOO_FEW_POLYGONS","text":""},{"location":"R_GE_S_TOO_FEW_POLYGONS/#anforderung","title":"Anforderung","text":"ID R_GE_S_TOO_FEW_POLYGONS Beschreibung Solids m\u00fcssen mindestens 4 Polygone haben. Fehlercode GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_TOO_FEW_POLYGONS Anforderungs ID R_GE_S_TOO_FEW_POLYGONS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL Beschreibung Fehlercode GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0001-T0002 SimpleSolid_SrefBS-GE-gml-SO-0001-T0001.gml GE_S_TOO_FEW_POLYGONS"},{"location":"basic/","title":"Validierung von 3D Stadtmodellen in CityGML","text":""},{"location":"basic/#begriffe-und-definitionen","title":"Begriffe und Definitionen","text":"<p>nach CityGML Quality Interoperability Experiment, chapter 3</p> <p>Validierung</p> <p>Prozess des validierens einer CityGML Datei nach spezifizierten Anforderungen. Eine valide Datei entspricht allen Anforderungen.</p> <p>Anforderungen</p> <p>Regeln und Einschr\u00e4nkungen, die die Datenstruktur eindeutig definieren. Anforderungen k\u00f6nnen von dem CityGML Standard Dokument abgleitet werden oder gesondert, als Anforderung an den CityGML Standard, definiert werden um Mehrdeutigkeiten des Standards zu verhindern oder zus\u00e4tzliche nutzerabh\u00e4ngige Anforderungen zu definieren.</p> <p>Pr\u00fcfung</p> <p>Algorithmische Implementation um eine Anforderung innerhalb eines Validerungsprogramms zu pr\u00fcfen.</p> <p>Fehler</p> <p>Ergebnis einer Pr\u00fcfung im Falle einer Nichtkonformit\u00e4t von Anforderungen.</p> <p>Validierungsplan</p> <p>Strukturierte Liste von Anforderungen, \u00fcberlicherweise angepasst an den konkreten Fall.</p>"},{"location":"basic/#zusatzliche-defintionen","title":"Zus\u00e4tzliche Defintionen:","text":"<p>XSD valide</p> <p>Eine CityGML Datei XSD valide wenn sie dem CityGML XML Schema entspricht.</p>"},{"location":"firstRun/","title":"Erster Start","text":""},{"location":"firstRun/#start","title":"Start","text":"<p>Nach dem entpacken der Zip Datei sollte je nach Version (GUI oder Batch) eine Struktur \u00e4hnlich diesem Bild rauskommen (Beispiel CityDoctorGUI): </p> <p>Um CityDoctor zu starten kann die start.bat verwendet werden.</p> <p>Die .bat Datei enth\u00e4lt dabei nur den Befehl:</p> <pre><code>java -classpath app/*;plugins/* de.hft.stuttgart.citydoctor2.gui.CityDoctorGUIStarter\n</code></pre> <p>Note</p> <p>Der Befehl hat sich \u00fcber die Versionshistorie von CityDoctor ver\u00e4ndert.</p> <p>F\u00fcr die Batch Version ist der Befehl analog und kann entsprechend f\u00fcr andere Betriebsysteme angepasst werden.</p> <p>Note</p> <p>F\u00fcr Linux oder Mac kann dieser Befehl auch verwendet werden, es muss nur das \";\" durch \":\" ersetzt werden. Der Rest bleibt gleich.</p>"},{"location":"geometric/","title":"Geometrieanforderungen","text":""},{"location":"geometric/#fehlercodes-fur-geometrische-fehler","title":"Fehlercodes f\u00fcr geometrische Fehler","text":"<p>Die Fehlercodes wurden \u00fcbernommen aus dem CityGML Quality Interoperability Experiment, chapter 7.5.</p> <p>Note</p> <p>Die Anforderungen wurden in CityDoctor umbenannt um einen auch von Menschen zu verstehenden Begriff, analog zu den Fehlercodes, darzustellen.</p> <p>Alle geometrischen Fehler sind in dem \"GE\" Definitionsbereich. Da geometrische Validierung basierend auf den Primitiven auf drei verschiedenen Ebenen ausgef\u00fchrt wird enth\u00e4lt jede Anforderung eine Ebene:</p> <ul> <li>Ring: R</li> <li>Polygon: P</li> <li>H\u00fclle (Shell): S</li> </ul> <p>Fehlercodes folgen dem selben Namensschema wie die Anforderungen, siehe auch Grundbegriffe. Jede Verletzung einer Anforderung muss in einem Fehler enden, der einen entsprechenden Fehlercode beinhaltet. Jeder Fehler kann (und sollte) zus\u00e4tzliche Informationen beinhalten (z.B. Wenn ein Ring nicht geschlossen ist, dann sollte die ID des Rings mitgegeben werden).</p>"},{"location":"geometric/#vertex-punkt-anforderungen","title":"Vertex (Punkt) Anforderungen","text":"<p>Zwei Punkte A und B sind gleich wenn die Euclidische-Distanz zwischen den beiden Punkten kleiner als eine definierte Gr\u00f6\u00dfe ist (minVertexDistance). Diese definierte Gr\u00f6\u00dfe findet auch in vielen Anforderungen wieder Anwendung, zum Beispiel ber\u00fchrt ein Punkt eine Kante wenn der Abstand des Punktes kleiner ist als minVertexDistance. In den folgenden Anforderungen wird die Gr\u00f6\u00dfe verwendet:</p> <ul> <li>R_GE_R_CONSECUTIVE_POINTS_SAME</li> <li>R_GE_R_NOT_CLOSED</li> <li>R_GE_R_SELF_INTERSECTION</li> <li>R_GE_P_INTERIOR_DISCONNECTED</li> </ul> <p>Die folgenden Anforderungen wurden auf den drei geometrischen Ebenen definiert (nach Ledoux (2013)):</p>"},{"location":"geometric/#linear-ring","title":"Linear Ring","text":"Anforderungs ID Beschreibung Fehlercode Bekannte Pr\u00fcfungen R_GE_R_TOO_FEW_POINTS Zu wenig Punkte in einem Ring GE_R_TOO_FEW_POINTS C_GE_R_TOO_FEW_POINTS R_GE_R_CONSECUTIVE_POINTS_SAME 2 aufeinanderfolgende Punkte sind gleich GE_R_CONSECUTIVE_POINTS_SAME C_GE_R_CONSECUTIVE_POINTS_SAME, C_GE_R_DUPLICATE_POINT R_GE_R_NOT_CLOSED Der erste und letzte Punkt sind nicht gleich GE_R_NOT_CLOSED C_GE_R_NOT_CLOSED R_GE_R_SELF_INTERSECTION Selbstverschneidung z.B. eine Schleife GE_R_SELF_INTERSECTION C_GE_R_SELF_INTERSECTION, C_GE_R_DUPLICATE_POINT R_GE_R_COLLAPSED_TO_LINE Momentan nicht in Benutzung, da redundant mit R_GE_R_SELF_INTERSECTION Ring ist ein Punkt oder eine Linie GE_R_COLLAPSED_TO_LINE C_GE_R_COLLAPSED_TO_LINE R_GE_R_ALL Container f\u00fcr: R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION -- --"},{"location":"geometric/#polygon","title":"Polygon","text":"Anforderungs ID Beschreibung Fehlercode Bekannte Pr\u00fcfungen R_GE_P_INTERSECTING_RINGS 2+ Ringe schneiden sich GE_P_INTERSECTING_RINGS C_GE_P_INTERSECTING_RINGS R_GE_P_NON_PLANAR Nicht planares Polygon, sowohl Distanz als auch Fl\u00e4chennormale Abweichungen GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION C_GE_P_NON_PLANAR R_GE_P_INTERIOR_DISCONNECTED Innenfl\u00e4che ist nicht verbunden GE_P_INTERIOR_DISCONNECTED C_GE_P_INTERIOR_DISCONNECTED R_GE_P_HOLE_OUTSIDE 1+ inneren Ringe ist komplett au\u00dferhalb des Polygons GE_P_HOLE_OUTSIDE C_GE_P_HOLE_OUTSIDE R_GE_P_INNER_RINGS_NESTED Innerer Ring ist komplett innerhalb eines anderen inneren Rings GE_P_INNER_RINGS_NESTED C_GE_P_INNER_RINGS_NESTED R_GE_P_ORIENTATION_RINGS_SAME \u00c4u\u00dferer Ring und innerer Ring haben die selbe Orientation GE_P_ORIENTATION_RINGS_SAME C_GE_P_ORIENTATION_RINGS_SAME R_GE_P_ALL Container f\u00fcr: R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME, R_GE_R_ALL -- --"},{"location":"geometric/#solid-hulle-shell","title":"Solid / H\u00fclle (Shell)","text":"Anforderungs ID Beschreibung Fehlercode Bekannte Pr\u00fcfungen R_GE_S_TOO_FEW_POLYGONS &lt;4 Polygone GE_S_TOO_FEW_POLYGONS C_GE_S_TOO_FEW_POLYGONS R_GE_S_NOT_CLOSED Die H\u00fclle ist nicht wasserdicht / hat 1+ L\u00f6cher GE_S_NOT_CLOSED C_GE_S_NOT_CLOSED R_GE_S_NON_MANIFOLD_VERTEX Jedes Polygon, das an einem Punkt anliegt muss \u00fcber Kanten mit den Anderen verbunden sein GE_S_NON_MANIFOLD_VERTEX C_GE_S_NON_MANIFOLD_VERTEX R_GE_S_NON_MANIFOLD_EDGE An jeder Kante d\u00fcrfen nur 2 Polygon anliegen GE_S_NON_MANIFOLD_EDGE C_GE_S_NON_MANIFOLD_EDGE R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Alle Polygone m\u00fcssen \u00fcber Punkte und Kanten verbunden sein GE_S_MULTIPLE_CONNECTED_COMPONENTS C_GE_S_MULTIPLE_CONNECTED_COMPONENTS R_GE_S_SELF_INTERSECTION Die H\u00fclle selbstverschneidet sich GE_S_SELF_INTERSECTION C_GE_S_SELF_INTERSECTION R_GE_S_POLYGON_WRONG_ORIENTATION Die Orientierung eines Polygons ist falsch GE_S_POLYGON_WRONG_ORIENTATION C_GE_S_POLYGON_WRONG_ORIENTATION R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Alle Polygone zeigen in die falsche Richtung GE_S_ALL_POLYGONS_WRONG_ORIENTATION C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION R_GE_S_ALL Container f\u00fcr: R_GE_S_TOO_FEW_POLYGONS, R_GE_S_NOT_CLOSED, R_GE_S_NON_MANIFOLD_VERTEX, R_GE_S_NON_MANIFOLD_EDGE, R_GE_S_MULTIPLE_CONNECTED_COMPONENTS, R_GE_S_SELF_INTERSECTION, R_GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION -- --"},{"location":"geometric/#parameter-uberblick","title":"Parameter \u00dcberblick","text":"Name Beschreibung Verwendet in Einheit minVertexDistance Minimale Abstand zwischen zwei Punkten bevor sie als der selbe Punkt angesehen werden R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_P_INTERIOR_DISCONNECTED Meter type Planarit\u00e4tspr\u00fcfungsart, kann distance, angle, both sein R_GE_P_NON_PLANAR - distanceTolerance Maximale Distanz eines Punktes von der Ausgleichsebene eines Polygons bevor es als Fehler angesehen wird R_GE_P_NON_PLANAR Meter angleTolerance Maximale Differenz im Winkel von angrenzenden Dreiecken einer Triangulierung bevor ein Polygon nicht mehr als Planar angesehen wird R_GE_P_NON_PLANAR Radiant"},{"location":"geometric/#abhangigkeitsbaum","title":"Abh\u00e4ngigkeitsbaum","text":"<p>Dies ist die Reihenfolge in der die Pr\u00fcfungen ausgef\u00fchrt werden. Wenn eine abh\u00e4ngige Pr\u00fcfung einen Fehler geworfen hat oder nicht ausgef\u00fchrt wurde, so wird die darauffolgende Pr\u00fcfung auch nicht ausgef\u00fchrt.</p> <pre><code>graph TD;\n  X0001[R_SC_SCHEMA_VALIDATION]\n  R0001[R_GE_R_TOO_FEW_POINTS]\n  R0002[R_GE_R_CONSECUTIVE_POINTS_SAME]\n  R0003[R_GE_R_NOT_CLOSED]\n  R0004[R_GE_R_SELF_INTERSECTION]\n  P0001[R_GE_P_INTERSECTING_RINGS]\n  P0002[R_GE_P_NON_PLANAR]\n  P0003[R_GE_P_INTERIOR_DISCONNECTED]\n  P0004[R_GE_P_HOLE_OUTSIDE]\n  P0005[R_GE_P_INNER_RINGS_NESTED]\n  P0006[R_GE_P_ORIENTATION_RINGS_SAME]\n\n  S0001[R_GE_S_TOO_FEW_POLYGONS]\n  S0002[R_GE_S_NOT_CLOSED]\n  S0003[R_GE_S_NON_MANIFOLD_VERTEX]\n  S0004[R_GE_S_NON_MANIFOLD_EDGE]\n  S0005[R_GE_S_MULTIPLE_CONNECTED_COMPONENTS]\n  S0006[R_GE_S_SELF_INTERSECTION]\n  S0007[R_GE_S_POLYGON_WRONG_ORIENTATION]\n  S0008[R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION]\n\n  X0001--&gt;R0003;\n  R0003--&gt;R0001;\n  R0001--&gt;R0002;\n  R0002--&gt;R0004;\n  R0004--&gt;P0002;\n  P0002--&gt;P0006;\n  P0006--&gt;P0003;\n  P0006--&gt;P0004;\n  P0006--&gt;P0005;\n  P0004--&gt;P0001;\n  P0005--&gt;P0001;\n  P0001--&gt;S0001;\n  P0003--&gt;S0001;\n  S0001--&gt;S0002;\n  S0001--&gt;S0004;\n  S0001--&gt;S0003;\n  S0001--&gt;S0005;\n  S0002--&gt;S0007;\n  S0004--&gt;S0007;\n  S0007--&gt;S0006;\n  S0003--&gt;S0006;\n  S0005--&gt;S0006;\n  S0006--&gt;S0008; \n</code></pre>"},{"location":"geometric/#multisurface-und-solid-geometrie","title":"Multisurface und Solid Geometrie","text":"<p>Um die Definition eines Validierungsplans zu vereinfachen werden zwei neue Anforderungen zus\u00e4tzlich eingef\u00fchrt. Diese Anforderungen dienen lediglich zur Gruppierung von den vorhandenen Anforderungen und ben\u00f6tigen keine zus\u00e4tzlichen Pr\u00fcfungen.</p> Anforderungs ID Beschreibung Abh\u00e4ngigkeiten Fehlercode Bekannte Pr\u00fcfungen R_GE_MS Valide Multisurface-Geometrie R_SC-SCHEMA-VALIDATION, R_GE_P_ALL -- -- R_GE_SO Valide H\u00fcllengeometrie R_SC-SCHEMA-VALIDATION, R_GE_S_ALL -- --"},{"location":"qual_ade/","title":"Quality-ADE","text":"<p>CityDoctor benutzt die Quality-ADE</p>"},{"location":"requiredSoftware/","title":"Ben\u00f6tigte Software","text":""},{"location":"requiredSoftware/#versionen-ab-3130","title":"Versionen ab 3.13.0","text":"<p>Ab Version 3.13.0 wurde ein Repository auf dem Transferportal der Hochschule erstellt, das fortan als Ablageort f\u00fcr fertige Releases verwendet wird: https://transfer.hft-stuttgart.de/gitlab/citydoctor/citydoctorreleases</p> <p>Die Versionen sind dort unterteilt zwischen CityDoctorValidation und CityDoctorGUI und unter diesen Ordnern gibt es die entsprechenden Versionsordner.</p>"},{"location":"requiredSoftware/#releaseversionen","title":"Releaseversionen","text":"<p>F\u00fcr jede CityDoctor Variante (CityDoctorValidation oder CityDoctorGUI) werden vier verschiedene Versionen zum Download bereitgestellt. Es werden in verschiedenen Versionen Java Runtimes der Liberica Distribution mitgeliefert. </p> Version Beschreibung CityDoctor*-no-runtime.zip Diese Version beinhaltet keine Runtime f\u00fcr Java. Falls auf Ihrem PC schon ein Java der Version 17 installiert ist (siehe Java), dann ist diese Version zu bevorzugen. CityDoctor*-win.zip Beinhaltet eine Windows Java Runtime zum ausf\u00fchren von CityDoctor, kein Java muss installiert sein. CityDoctor*-lin.zip Beinhaltet eine Linux Java Runtime zum ausf\u00fchren von CityDoctor CityDoctor*-mac.zip Beinhaltet eine Mac Java Runtime zum ausf\u00fchren von CityDoctor"},{"location":"requiredSoftware/#versionen-bis-312x","title":"Versionen bis 3.12.x","text":"<p>CityDoctor kann von verschiedenen Seiten heruntergeladen werden. Die aktuellste Stelle ist ein gitlab Repository. Alternativ werden Releases auch auf der CityDoctor Homepage der BHT gelistet. Es gibt dabei immer zwei Versionen:</p> <ul> <li>CityDoctorGUI-3.x.x.zip: Das ist die grafische Oberfl\u00e4che inklusive der Pr\u00fcfungen. Geeignet f\u00fcr den Endnutzer auf einem Desktop PC.</li> <li>CityDoctorValidation-3.x.x.zip: Das ist die Batch-Version die f\u00fcr die Integration in Servern oder anderen bestehenden Systemen geeignet ist und hat keine grafische Oberfl\u00e4che sondern arbeitet Dateibasiert als Prozess.</li> </ul> <p>Note</p> <p>Es gibt manchmal Spezialversionen die Testweise erstellt worden sind um verschiedene Auslieferungsm\u00f6glichkeiten zu testen. Bsp: CityDoctorGUI-x.x.x-win.zip beinhaltet die JavaFX Bibliotheken sodass eine Java Umgebung ohne JavaFX auch verwendet werden kann.</p>"},{"location":"requiredSoftware/#java","title":"Java","text":"<p>Vor der CityDoctor Version 3.12.x wird Java 8 entweder als JDK oder als JRE ben\u00f6tigt. Ab der Version 3.12.x wird Java 17 ben\u00f6tigt.</p> <p>Warning</p> <p>Es wichtig, dass die installierte Java Version die JavaFX Bibliotheken mit einschlie\u00dft. Diese werden f\u00fcr die grafische Oberfl\u00e4che ben\u00f6tigt.</p> <p>Die Liberica JRE oder JDK hat sich f\u00fcr einen Einsatz mit CityDoctor bew\u00e4hrt.</p> <p>Note</p> <p>Die Liberica Distribution ist zu 100% frei und OpenSource.</p> <p>Note</p> <p>F\u00fcr die Entwicklung mit CityDoctor wird eine JDK ben\u00f6tigt.</p>"},{"location":"requirements/","title":"Anforderungen und Pr\u00fcfungen f\u00fcr die Validierung von CityGML-Modellen","text":"<p>Die Anforderungen sind die Grundbausteine f\u00fcr ein Validierungsplan um CityGML-Modelle zu validieren. F\u00fcr Namenskonventionen und Definitionen, siehe Grundbegriffe.  </p> <p>Eine Anforderung kann durch einen oder mehrere Pr\u00fcfungen validiert werden. Eine Pr\u00fcfung validiert ein oder mehrere Anforderungen bei einem Modell. Jede Pr\u00fcfung kann Vorbedingungen haben. Wenn diese Vorbedingungen nicht erf\u00fcllt sind wird die Pr\u00fcfung nicht ausgef\u00fchrt.</p> <p>Unterschieden wird dabei zwischen:</p> <ul> <li>Schemaanforderungen</li> <li>Geometrieanforderungen</li> <li>Semantische Anforderungen</li> </ul>"},{"location":"schemaRequirements/","title":"Schemaanforderungen","text":""},{"location":"schemaRequirements/#r_sc_schema_validation","title":"R_SC_SCHEMA_VALIDATION","text":""},{"location":"schemaRequirements/#anforderung","title":"Anforderung","text":"ID R_SC_SCHEMA_VALIDATION Beschreibung Eine grundlengende Anforderung ist, dass jedes CityGML Dokument wohl definiert sein muss und XSD valide ist. Fehlercode SC-SCHEMA-NOT-VALID"},{"location":"schemaRequirements/#prufung","title":"Pr\u00fcfung","text":"ID SC_SCHEMA_VALIDATION Anforderungs ID R_SC_SCHEMA_VALIDATION Vorbedingungen keine Beschreibung Werkzeuge um eine XSD Validierung durchzuf\u00fchren sind verf\u00fcgbar und geben verl\u00e4ssliche Ergebnisse Fehlercode SC_SCHEMA_NOT_VALID"},{"location":"semantic/","title":"Semantische Anforderungen","text":"<p>Die semantischen Anforderungen sind meistens auf Attributbasis. Daraus ergeben sich 3 Fehlerzust\u00e4nde f\u00fcr ein Attribut:</p> <ul> <li>SE_ATTRIBUTE_WRONG_VALUE: Wenn ein Attribut ein falschen Wert hat.</li> <li>SE_ATTRIBUTE_MISSING: Wenn ein Attribut fehlt, aber vorhanden sein sollte.</li> <li>SE_ATTRIBUTE_INVALID: Wenn ein Attribut vorhanden ist aber verboten ist.</li> </ul>"},{"location":"semantic/#schematron","title":"Schematron","text":"<p>In CityDoctor wurde das XML Validierungssystem Schematron integriert um flexibel Attributpr\u00fcfungen anzupassen und zu unterst\u00fctzen. </p> <p>Hier ist ein Beispiel f\u00fcr eine Schematron Datei die CityDoctor integrieren kann:</p>"},{"location":"semantic/#citydoctor-3130","title":"CityDoctor &gt;= 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n\n</code></pre>"},{"location":"semantic/#citydoctor-3130_1","title":"CityDoctor &lt; 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n</code></pre> <p>Diese Datei pr\u00fcft, dass alle Buildings in sich selbst oder in einem ihrer Unterelementen ein Solid beliebigen LODSs vorhanden ist. Au\u00dferdem stellt die Datei sicher, dass jedes BuildingPart ein Solid enth\u00e4lt. Wenn dies nicht der Fall ist wird eine Fehlermeldung ausgegeben. Die Fehlermeldung ist dabei so formattiert, dass CityDoctor sie interpretieren und in das interne Datenmodell einbinden kann.</p>"},{"location":"semantic/#fehlerformat","title":"Fehlerformat","text":"<p>Das Fehlerformat ist ein CSV-Format mit || als Trennzeichen</p> <pre><code>parent id||child id||error code||error type||is generic attribute\n</code></pre> <p>Die Fehlermeldung besteht aus den folgenden Teilen:</p> <ul> <li>Die <code>parent id</code> ist die gml id des obersten Elements z.B. Building oder Bridge. </li> <li>Falls der Fehler in einem Unterelement aufgetreten ist so kann diese ID in dem Feld f\u00fcr die <code>child id</code> eingetragen werden.</li> <li>Im Feld <code>error type</code> ist einer der 3 Fehlertypen einzutragen: <code>SE_ATTRIBUTE_WRONG_VALUE, SE_ATTRIBUTE_MISSING, SE_ATTRIBUTE_INVALID</code>.</li> </ul> <p>note Nur in CityDoctor &lt; 3.13.0: * Um ein generisches Attribut mit dem Namen <code>measuredHeight</code> von dem nicht generischen Attribut zu unterscheiden ist im letzten Feld vorgesehen <code>true</code> einzutragen wenn es sich um ein generisches Attribut handelt ansonsten <code>false</code>. </p>"},{"location":"udt_about/","title":"UDigiT-Doctor","text":"<p>Erweiterung des CityDoctor2 f\u00fcr die Integration von urbanen digitalen Zwillingen</p> <p></p> <p>Das UDigiT-Doctor Projekt sieht eine Weiterentwicklung des CityDoctor2 vor, mit dem Ziel die Pr\u00fcfung von urbanen digitalen Zwillingen durch die Validierungs- und Reparaturfunktionen des CityDoctors zu erm\u00f6glichen.</p>"},{"location":"udt_about/#fragestellung","title":"Fragestellung","text":"<p>Zusammengefasst k\u00f6nnen f\u00fcr eine \u00dcbertragung der Qualit\u00e4tssicherung von Geb\u00e4udemodellen auf UDT folgende wissenschaftliche und technische Schwerpunkteziele abgeleitet werden:</p> <ul> <li>Entwurf einer internen Datenstruktur und Erarbeitung von Verfahren zur Erzeugung eines integrierten Gesamtmodells </li> <li>\u00dcberpr\u00fcfung der topologischen Beziehungen von Objekten sowohl zur Sicherstellung grundlegender Eigenschaften eines allgemein verwendbaren Basis-Modells als auch f\u00fcr ausgew\u00e4hlte Anwendungsszenarien (Leitungsnetze, Geb\u00e4udeanschl\u00fcsse, etc.)</li> <li>Erweiterung des Pr\u00fcf- und Reparaturprozesses durch Vergleichsmethoden unter Verwendung von Referenzmodellen</li> <li>Umfassende und konfigurierbare Semantikpr\u00fcfung</li> </ul>"},{"location":"udt_about/#lizenz","title":"Lizenz","text":"<p>UDigiT-Doctor, bzw. CityDoctor2, wird weiterhin als FOSS unter der LGPL ver\u00f6ffentlicht.</p>"},{"location":"udt_about/#releases","title":"Releases","text":"<p>Releases von UDigiT-Doctor werden \u00fcber das GitLab Repository von CityDoctor2 verf\u00fcgbar gemacht.</p>"},{"location":"udt_about/#projektdaten","title":"Projektdaten","text":"<p>Projektlaufzeit: 01.04.2024 - 01.07.2027</p> <p>Projekt Website: UDigiT-Doctor: Hochschule f\u00fcr Technik Stuttgart UDigiT-Doctor: Berliner Hochschule f\u00fcr Technik</p> <p>Projektleitung: Prof. Dr.-Ing. Volker Coors</p> <p>Verbundpartner: Prof. Dr. Margitta Pries</p>"},{"location":"udt_about/#partner","title":"Partner","text":"<p>Kooperationspartner: Robert Bosch GmbH Geoplex GIS GmbH M.O.S.S. Computer Grafik Systeme GmbH LandPlan OS GmbH Point Cloud Technology GmbH virtualcitysystems GmbH</p> <p>Assoziative Partner: Open Geospatial Consortium Stadt Stuttgart Stadt Leverkusen </p> <p>Mittelgeber: Bundesamt f\u00fcr Bildung und Forschung</p> <p>Projekttr\u00e4ger: VDI Technologiezentrum </p>"},{"location":"udt_req_overview/","title":"Anforderungen an UDigiT-Doctor","text":"<ol> <li>Entwurf einer internen Datenstruktur und Erarbeitung von Verfahren zur Erzeugung eines integrierten Gesamtmodells.</li> <li>\u00dcberpr\u00fcfung der topologischen Beziehungen von Objekten sowohl zur Sicherstellung grundlegender Eigenschaften eines allgemein verwendbaren Basis-Modells als auch f\u00fcr ausgew\u00e4hlte Anwendungszenarien (Leitungsnetze, Geb\u00e4udeanschl\u00fcsse, ...)</li> <li>Erweiterung des Pr\u00fcf- und Reperaturprozesses durch Vergleichsmethoden unter Verwendung von Referenzmodellen</li> <li>Umfassende und konfigurierbare Semantikpr\u00fcfung</li> </ol> Spezielle Anforderungen von Relevant f\u00fcr Anforderungen Nr. Datenmodell 1., 2., 3. Topologische Konsistenz 2., 3. Semantische \u00dcberpr\u00fcfung 2., 4."},{"location":"udt_terms/","title":"Validierung von urbanen digitalen Zwillingen","text":""},{"location":"udt_terms/#begriffe-und-definitionen","title":"Begriffe und Definitionen","text":"<p>Siehe auch: Begriffe und Definitionen von CityDoctor2</p> <p>Urbaner digitaler Zwilling</p> <p>Ein urbaner digitaler Zwilling ist ein repr\u00e4sentatives, virtuelles Modell eines realen Geb\u00e4udes. Digitale Zwillinge dienen, unter anderem, der Simulation von verschiedenen Prozessen, als auch als zentraler Sammelpunkt f\u00fcr Daten und Informationen. Dies schlie\u00dft bei urbanen digitalen Zwillingen auch Daten von installierten Sensoren und Geb\u00e4udeleittechniksystemen ein.</p>"},{"location":"userInterface/","title":"Nutzeroberfl\u00e4che","text":""},{"location":"userInterface/#citydoctor","title":"CityDoctor","text":"<p>In der oberen Leiste sind folgende Schaltfl\u00e4chen in Reihenfolge:</p> <ul> <li>Laden: \u00d6ffnet den Dialog zum laden einer CityGML Datei</li> <li>Pr\u00fcfen: \u00d6ffnet den Dialog zum pr\u00fcfen einer geladenen CityGML</li> <li>Pr\u00fcfberichte: \u00d6ffnet den Dialog zum schreiben eines Pr\u00fcfprotokolls in xml oder pdf Form</li> <li>Gitternetz: Zeigt/Versteckt das Gitternetz anstatt gef\u00fcllter Polygone</li> <li>R\u00fcckseiten: Zeigt/Versteckt R\u00fcckseiten von Polygonen</li> <li>Globale Ansicht: L\u00e4dt alle Elemente einer CityGML in die Ansicht</li> <li>LODs: Schaltet einzelne LODs von der Ansicht an oder aus</li> <li>Speichern: Speichert eine CityGML Datei zur\u00fcck, falls die Datei gepr\u00fcft wurde wird die QualityADE mitgeschrieben.</li> <li>About: \u00d6ffnet den Dialog mit Informationen zu dem Projekt CityDoctor2</li> <li>Ansichten: Wechselt verschiedene Ansichten. F\u00fcr die Pr\u00fcfung gibt es nur eine.</li> <li>Sprache: Hier kann die Sprache eingestellt werden (Deutsch/Englisch)</li> </ul> <p>Warning</p> <p>Das Anzeigen der Globalen Ansicht kann bei gro\u00dfen CityGML Dateien (&gt; 100mb je nach System) zu abst\u00fcrzen f\u00fchren. Das Anzeigen kann kurz dauern.</p>"},{"location":"userInterface/#laden","title":"Laden","text":"<p>\u00dcber die Schaltfl\u00e4che Laden wird der Dialog zum laden einer CityGML Datei ge\u00f6ffnet.</p> <p></p> <p>In der Datei Leiste kann ein Dateipfad eingetragen werden oder \u00fcber die Schaltfl\u00e4che Ausw\u00e4hlen ausgew\u00e4hlt werden.</p> <p>Au\u00dferdem k\u00f6nnen weitere Einstellungen f\u00fcr das Lesen der Datei angegeben werden.</p> <ul> <li>NumberOfRoundingPlaces: Auf wie viele Nachkommastellen werden die eingelesenen Werte gerundet.</li> <li>XML-Validierung: F\u00fchrt eine XML Validierung durch. Fehler werden dabei direkt beim einlesen festgestellt und das Einlesen wird abgebrochen.</li> <li>Speicherverbrauch: Spart RAM um gr\u00f6\u00dfere Dateien in der GUI zu erm\u00f6glichen. Kostet geringf\u00fcgig Performance bei der Pr\u00fcfung.</li> </ul> <p>Beim Laden wird der Fortschritt ungef\u00e4hr durch den Ladebalken repr\u00e4sentiert.</p> <p>Note</p> <p>Dateien k\u00f6nnen auch direkt per Drag and Drop vom Dateimanager in die GUI gezogen werden ohne den Laden Dialog zu verwenden. Dabei werden die Default Werte angenommen (8 Nachkommastellen, keine XML-Validierung)</p> <p>Nach dem Laden einer CityGML Datei werden die Elemente in den einzelnen Tabs angezeigt. Durch ausw\u00e4hlen eines Elements wird das in der Ansicht angezeigt.</p> <p></p> <p>Note</p> <p>Durch Ausw\u00e4hlen des obersten Elements eines Reiters werden alle Elemente innerhalb diese Reiters angezeigt. Wie obige Warnung schon besagt, gilt auch hier, dass gr\u00f6\u00dfere Datenmengen zu Abst\u00fcrzen f\u00fchren.</p>"},{"location":"userInterface/#prufen","title":"Pr\u00fcfen","text":"<p>Im Pr\u00fcfdialog kann der Validierungsplan angepasst werden. Hier werden neben den Verf\u00fcgbaren Pr\u00fcfungen auch die globalen Parameter angezeigt.</p> <p>Ver\u00e4ndert k\u00f6nnen die Parameter mit einem Doppelklick in die Wert Spalte. Die Einheit ist dabei fest.</p> <p>Note</p> <p>Der Parameter numberOfRoundingPlaces kann nicht ver\u00e4ndert werden. Er wurde beim Laden der Datei festgelegt.</p> <p>Falls Pr\u00fcfungen nicht ausgef\u00fchrt werden sollen k\u00f6nnen sie in der Spalte Aktiv deaktiviert werden.</p> <p>Warning</p> <p>Wenn Pr\u00fcfungen deaktiviert wurden die andere aktiven Pr\u00fcfungen aber als Abh\u00e4ngigkeit ben\u00f6tigen werden sie bei der Pr\u00fcfung wieder aktiviert um die Stabilit\u00e4t zu gew\u00e4hrleisten. Siehe Anforderungen.</p> <p>In dem Feld Schematron Datei kann ein Pfad zu einer Schematron Datei eingetragen werden. In dieser Datei k\u00f6nnen flexible Regeln f\u00fcr die semantischen Anforderungen festgelegt werden. Siehe Semantische Pr\u00fcfungen</p> <p>\u00dcber die beiden Schaltfl\u00e4chen oben rechts kann der Pr\u00fcfplan gespeichert und geladen werden.</p> <p>Nach der Pr\u00fcfung werden fehlerhafte Elemente rot und fehlerfreie Elemente gr\u00fcn eingef\u00e4rbt. Bei der Auswahl eines Elements das fehler beinhaltet werden die Fehler in dem unteren Tab Fehler angezeigt. Dort kann der Fehler ausgew\u00e4hlt werden um ihn in CityDoctor anzuzeigen und weitere Informationen zu erhalten.</p> <p></p> <p>Die Elemente k\u00f6nnen mit dem Dropdown-Men\u00fc gefiltert werden um nur fehlerhafte Elemente anzuzeigen.</p>"},{"location":"userInterface/#prufberichte","title":"Pr\u00fcfberichte","text":"<p>In diesem Dialog gibt es nochmal eine \u00dcbersicht \u00fcber die Fehler in Bildform und die M\u00f6glichkeit einen xml oder pdf Bericht zu schreiben.</p> <p></p>"},{"location":"validationPlan/","title":"Validierungsplan","text":"<p>der Validierungsplan f\u00fcr CityDoctor wird in YAML angegeben.</p> <p>F\u00fcr die Version 3.12.x und neuere sieht ein Beispiel so aus:</p> <pre><code>globalParameters:\n   numberOfRoundingPlaces: 8\n   # in m\n   minVertexDistance: 0.0001\n   schematronPath: 'checkForSolid.xml'\nuseStreaming: true # (1)!\nrequirements:\n   R_GE_R_TOO_FEW_POINTS:\n      enabled: true\n   R_GE_R_NOT_CLOSED:\n      enabled: true\n   R_GE_R_CONSECUTIVE_POINTS_SAME:\n      enabled: true\n   R_GE_R_SELF_INTERSECTION:\n      enabled: true\n   R_GE_S_MULTIPLE_CONNECTED_COMPONENTS:\n      enabled: true\n   R_GE_P_INTERIOR_DISCONNECTED:\n      enabled: true\n   R_GE_P_INTERSECTING_RINGS:\n      enabled: true\n   R_GE_P_NON_PLANAR:\n      enabled: true\n      parameters:\n         # one of (\"distance\", \"angle\", \"both\")\n         type: distance\n         # in m\n         distanceTolerance: 0.01\n         # in degree\n         angleTolerance: 1\n   R_GE_P_HOLE_OUTSIDE:\n      enabled: true\n   R_GE_P_ORIENTATION_RINGS_SAME:\n      enabled: true\n   R_GE_P_INNER_RINGS_NESTED:\n      enabled: true\n   R_GE_S_TOO_FEW_POLYGONS:\n      enabled: true\n   R_GE_S_NOT_CLOSED:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_EDGE:\n      enabled: true\n   R_GE_S_POLYGON_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_VERTEX:\n      enabled: true\n   R_GE_S_SELF_INTERSECTION:\n      enabled: true\n   R_SE_BS_IS_WALL:\n      enabled: false\n      parameters:\n            lowerAngle: '45'\n            upperAngle: '135'\n   R_SE_BS_IS_FLOOR:\n      enabled: false\n   R_SE_BS_GROUND_UNFRAGMENTED:\n      enabled: false\n   R_SE_BS_IS_GROUND:\n      enabled: false\n   R_SE_BS_IS_CEILING:\n      enabled: false\n</code></pre> <ol> <li>Der Parameter <code>useStreaming</code> ist ein Schalter um eine Datei St\u00fcck f\u00fcr St\u00fcck einzulesen anstelle erst die komplette Datei zu lesen bevor die Pr\u00fcfung stattfindet. Mit dieser Einstellung k\u00f6nnen auch Dateien &gt; 2GB ohne gro\u00dfe RAM Anforderungen gepr\u00fcft werden.</li> </ol> <p>In dem Validierungsplan finden sich die selben Einstellungen wieder, die in der grafischen Oberfl\u00e4che auch aufgelistet sind.</p> <p>Unter requirements sind alle Anforderungen gelistet die gepr\u00fcft werden sollen. Dabei sind die semantischen Pr\u00fcfungen standardm\u00e4\u00dfig deaktiviert. </p>"},{"location":"zipFiles/","title":"Zip-Archive","text":"<p>CityDoctor kann Zip-Dateien einlesen und enthaltene CityGML Dateien validieren.</p>"},{"location":"zipFiles/#laden-von-zip-archiven","title":"Laden von Zip-Archiven","text":"<p>Zip-Dateien k\u00f6nnen \u00fcber den Ladedialog ausgew\u00e4hlt und importiert werden. CityDoctor durchsucht die Zip-Datei nach m\u00f6glichen CityGML Dateien</p>"},{"location":"zipFiles/#zip-eintrag-manager","title":"Zip-Eintrag Manager","text":"<p>Nachdem CityDoctor erfolgreich ein Zip-Archiv importiert hat, wird der Zip-Eintrag Manager angezeigt. Der Zip-Eintrag Manager hat folgende Schaltfl\u00e4chen:</p> <ol> <li>Modell anzeigen: Zeigt das Stadtmodell der ausgew\u00e4hlten, entpackten Datei im Hauptfenster von CityDoctor.</li> <li>Datei entpacken: Entpackt die ausgew\u00e4hlte Datei.</li> <li>Fehlerstatistik anzeigen: Zeigt die Fehlerstatistik der ausgew\u00e4hlten Datei. Nur verf\u00fcgbar bei validierten Dateien.</li> <li>Alle Dateien entpacken: Entpackt alle Dateien im Archiv.</li> <li>Alle Dateien pr\u00fcfen: \u00d6ffnet den Check-Dialog f\u00fcr die Batch-Validierung aller Dateien. Siehe Validierung f\u00fcr mehr Informationen.</li> <li>Validierungsergebnisse exportieren: Erm\u00f6glicht das Speichern der Validierungsberichte. Verf\u00fcgbar nachdem mindestens eine Datei validiert wurde.</li> </ol> <p></p> <p>Der aktuelle Status der Dateien wird mithilfe eines Farbcodes angezeigt:</p> <ul> <li>Komprimiert (Schwarz): Eine komprimierte Datei ist noch 'gezippt'.</li> <li>Entpackt (Blau): Eine entpackte Datei wurde erfolgreich in den Arbeitsspeicher geladen.</li> <li>Leeres Modell (Grau): Eine entpackte Datei, welche kein Stadtmodell oder ein Stadtmodell ohne Features beinhaltet.</li> <li>Fehlerhafte Datei (Dunkelrot): Eine Datei, welche nicht erfolgreich entpackt werden konnte. M\u00f6gliche Ursachen sind fehlerhafte CityGml Dateien, Modelle die zu gro\u00df f\u00fcr den verf\u00fcgbaren Arbeitsspeicher sind oder Probleme beim Einlesen der Datei. Der genaue Grund wird in den Metadaten angezeigt.</li> <li>Validierte Dateien mit / ohne Fehlern (Hellrot bzw. Gr\u00fcn)</li> </ul> <p>Note</p> <p>Das originale Zip-Archiv wird nicht ver\u00e4ndert, entpackte Dateien sind Kopien.</p>"},{"location":"zipFiles/#validierung","title":"Validierung","text":""},{"location":"zipFiles/#validierung-einzelner-dateien","title":"Validierung einzelner Dateien","text":"<p>Entpackte Dateien k\u00f6nnen \u00fcber das CityDoctor Hauptfenster validiert werden. Das jeweils letzte Ergebnis der Validierung von jeder Datei wird hierbei im Arbeitsspeicher behalten, bis CityDoctor geschlossen oder ein neues Zip-Archiv geladen wird.</p>"},{"location":"zipFiles/#batch-validierung","title":"Batch Validierung","text":"<p>Die \"Alle Dateien pr\u00fcfen\" Schaltfl\u00e4che \u00f6ffnet die Einstellungen f\u00fcr die Batch-Validierung. Sie kann ohne vorheriges entpacken der Dateien durchgef\u00fchrt werden und verf\u00fcgt \u00fcber zwei Vorgehensweisen:</p>"},{"location":"zipFiles/#standardmodus","title":"Standardmodus","text":"<p>Der Standardmodus f\u00fchrt die Validierung \u00fcber alle Dateien im Archiv aus. Komprimierte Dateien werden hierbei automatisch entpackt. Wie bei der Individuellen Validierung werden die Ergebnisse im Arbeitsspeicher gehalten und k\u00f6nnen mit dem CityDoctor inspiziert werden.</p>"},{"location":"zipFiles/#niedriger-arbeitsspeicherverbrauchsmodus-datenstream-modus","title":"Niedriger Arbeitsspeicherverbrauchsmodus (Datenstream Modus)","text":"<p>In diesem Modus werden Datenstreams genutzt, um die Features der Stadtmodelle einzeln einzulesen und zu validieren. Dies reduziert den ben\u00f6tigten Arbeitsspeicher, da die Dateien zur \u00fcberpr\u00fcfung nicht entpackt werden m\u00fcssen. Dies bedeutet jedoch auch, dass der Status der Dateien unver\u00e4ndert bleibt. Die Ergebnisse werden in Validierungsberichten gespeichert und k\u00f6nnen nicht in CityDoctor inspiziert werden.</p>"}]}
\ No newline at end of file
+{"config":{"lang":["de"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"CityDoctor","text":"<p>Software zur Pr\u00fcfung und automatisierten Reparatur virtueller Stadtmodelle </p> <p>CityDoctor2 ist eine Qualit\u00e4tspr\u00fcfungssoftware f\u00fcr 3D Stadtmodelle im CityGML format. CityDoctor kann CityGML 1/2 Dokumente einlesen und seit Version 3.12 kann auch eingeschr\u00e4nkt CityGML 3 gelesen werden. Alle Pr\u00fcfergebnisse k\u00f6nnen in xml oder pdf Form ausgegeben werden. Zus\u00e4tzlich implementiert CityDoctor die QualityADE um Pr\u00fcfergebnisse direkt in CityGML zu speichern.</p> <p></p>"},{"location":"#lizenzen-versionen","title":"Lizenzen / Versionen","text":""},{"location":"#citydoctorvalidation","title":"CityDoctorValidation","text":"<p>Der Validierungsteil von CityDoctor ist frei verf\u00fcgbar und OpenSource</p>"},{"location":"#citydoctorgui","title":"CityDoctorGUI","text":"<p>Die grafische Oberfl\u00e4che ist frei verf\u00fcgbar und OpenSource</p>"},{"location":"#citydoctorhealer","title":"CityDoctorHealer","text":"<p>Der Teil zust\u00e4ndig f\u00fcr die Reparatur frei verf\u00fcgbar und OpenSource Die Reparatur funktioniert nur prototypisch und hat keine Garantie, dass jeder Fehler behoben werden kann oder es \u00fcberhaupt eine Verbesserung gibt.</p> <p>Bei Fragen Mail an:  </p>"},{"location":"#projekte","title":"Projekte","text":"<p>CityDoctor wurde in mehreren Projekten entwickelt. Momentan wird CityDoctor im Rahmen des Projekts UDigitDoctor entwickelt.</p> <p>Vergangenes Projekt:</p> <ul> <li>CityDoctor2</li> </ul>"},{"location":"R_GE_MS/","title":"R_GE_MS","text":""},{"location":"R_GE_MS/#anforderung","title":"Anforderung","text":"ID R_GE_MS Beschreibung Ein MultiSurface ist eine Sammlung von Polygonen ohne weitere Einschr\u00e4nkungen. Ein MultiSurface ist nur g\u00fcltig, wenn alle Polygone g\u00fcltig sind. Die Anforderungen R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_R_TOO_FEW_POINTS, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME m\u00fcssen erf\u00fcllt werden Fehlercode --"},{"location":"R_GE_MS/#prufung","title":"Pr\u00fcfung","text":"<p>Keine weiteren Pr\u00fcfungen notwendig. Die einzelnen Anforderungen haben eigene Pr\u00fcfungen f\u00fcr ihre Erf\u00fcllung.</p>"},{"location":"R_GE_MS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis <p>Existierende Testf\u00e4lle k\u00f6nnen verwendet werden. </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/","title":"R_GE_P_HOLE_OUTSIDE","text":""},{"location":"R_GE_P_HOLE_OUTSIDE/#anforderung","title":"Anforderung","text":"ID R_GE_P_HOLE_OUTSIDE Beschreibung Innerer Ring darf nicht komplett au\u00dferhalb des \u00e4u\u00dferen Rings sein. Fehlercode GE_P_HOLE_OUTSIDE <p>Beispiel:  </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_HOLE_OUTSIDE Anforderungs ID R_GE_P_HOLE_OUTSIDE Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Beschreibung Fehlercode GE_P_HOLE_OUTSIDE"},{"location":"R_GE_P_HOLE_OUTSIDE/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0004-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0004-T0002 SimpleSolid_SrefBS-GE-gml-PO-0004-T0001.gml GE_P_HOLE_OUTSIDE in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INNER_RINGS_NESTED/","title":"R_GE_P_INNER_RINGS_NESTED","text":""},{"location":"R_GE_P_INNER_RINGS_NESTED/#anforderung","title":"Anforderung","text":"ID R_GE_P_INNER_RINGS_NESTED Beschreibung Innere Ringe d\u00fcrfen nicht innerhalb eines anderen inneren Rings sein. Fehlercode GE_P_INNER_RINGS_NESTED <p>Beispiel:  </p>"},{"location":"R_GE_P_INNER_RINGS_NESTED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_INNER_RINGS_NESTED Anforderungs ID R_GE_P_INNER_RINGS_NESTED Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Beschreibung Fehlercode GE_P_INNER_RINGS_NESTED"},{"location":"R_GE_P_INNER_RINGS_NESTED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0005-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0005-T0002 SimpleSolid_SrefBS-GE-gml-PO-0005-T0001.gml GE_P_INNER_RINGS_NESTED in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/","title":"R_GE_P_INTERIOR_DISCONNECTED","text":""},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#anforderung","title":"Anforderung","text":"ID R_GE_P_INTERIOR_DISCONNECTED Beschreibung Die innere Fl\u00e4che eines Polygons muss verbunden sein. Parameter minVertexDistance Ein Punkt ber\u00fchrt eine Kante, wenn der Abstand kleiner als minVertexDistance ist, siehe Vertex Anforderungen Fehlercode GE_P_INTERIOR_DISCONNECTED <p>Beispiele:  </p> <p></p>"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_INTERIOR_DISCONNECTED Anforderungs ID R_GE_P_INTERIOR_DISCONNECTED Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, GE_P_ORIENTATION_RINGS_SAME Beschreibung Fehlercode GE_P_INTERIOR_DISCONNECTED"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0003-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0003-T0002 SimpleSolid_SrefBS-GE-gml-PO-0003-T0001.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0003-T0003 SimpleSolid_SrefBS-GE-gml-PO-0003-T0002.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERSECTING_RINGS/","title":"R_GE_P_INTERSECTING_RINGS","text":""},{"location":"R_GE_P_INTERSECTING_RINGS/#anforderung","title":"Anforderung","text":"ID R_GE_P_INTERSECTING_RINGS Beschreibung \u00c4u\u00dferer und innere Ringe d\u00fcrfen sich nicht verschneiden Parameter minVertexDistance Zwei Ringe verschneiden sich nicht, wenn nur ein Punkt des einen Rings den Anderen ber\u00fchrt. Ein Punkt ber\u00fchrt eine Kante nur dann wenn der Abstand weniger als minVertexDistance ist. Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_P_INTERSECTING_RINGS <p>Beispiele:</p> <p>\u00c4u\u00dferer Ring verschneidet inneren Ring: </p> <p>Zwei innere Ringe verschneiden sich: </p>"},{"location":"R_GE_P_INTERSECTING_RINGS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_INTERSECTING_RINGS Anforderungs ID R_GE_P_INTERSECTING_RINGS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME Beschreibung Wenn ein Punkt eines inneren Rings au\u00dferhalb des \u00e4u\u00dferen ist oder innerhalb eines anderen inneren Rings, ist das eine Verschneidung. Fehlercode GE_P_INTERSECTING_RINGS"},{"location":"R_GE_P_INTERSECTING_RINGS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0001-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0001.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0001-T0002 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0001-T0003 SimpleSolid_SrefBS-GE-gml-PO-0001-T0003.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_NON_PLANAR/","title":"R_GE_P_NON_PLANAR","text":""},{"location":"R_GE_P_NON_PLANAR/#anforderung","title":"Anforderung","text":"ID R_GE_P_NON_PLANAR Beschreibung Jedes Polygon muss planar sein. Planarit\u00e4t ist erreicht, wenn kein Punkt weiter als distanceTolerance von der Regressionsebene aller Punkte entfernt ist, sowie die Normalen jedes Dreiecks des tessellierten Polygons keine gr\u00f6\u00dfere Winkelabweichung als angleTolerance haben. Parameter 1:   type Der Typ der Planarit\u00e4tspr\u00fcfung kann ausgew\u00e4hlt werden. Muss eins von distance, angle, both sein.<ul><li>Wenn der Parameter distance ist: Nur die Distanzpr\u00fcfung wird ausgef\u00fchrt.</li><li> Wenn der Parameter angle ist: Nur die Normalenabweichungspr\u00fcfung wird ausgef\u00fchrt.</li><li>Wenn der Parameter both ist: Beide Pr\u00fcfungen werden ausgef\u00fchrt.</li></ul> Parameter 2:   distanceTolerance Toleranz der Distanz eines Punktes von der Regressionsebene Parameter 3:   angleTolerance Toleranz des Winkels der Dreiecksnormalen Fehlercodes GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION <p>Normalen Abweichung:  </p> <p>Distanz eines Punktes zur Regressionsebene:  </p>"},{"location":"R_GE_P_NON_PLANAR/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_NON_PLANAR Anforderungs ID R_GE_P_NON_PLANAR Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL Beschreibung Um die Normalenabweichung zu bestimmen, werden alle Polygone tesselliert, um die Dreiecksnormalen zu berechnen, deren Winkel f\u00fcr den Vergleich verwendet werden. Die Tessellierung der Polygone ist nicht eindeutig und damit ist das Ergebnis der Pr\u00fcfung der Normalenabweichung nicht eindeutig. F\u00fcr die Distanzpr\u00fcfung wird eine Regressionsebene aus allen Polygonpunkten erstellt, um den Abstand der Punkte zu dieser Ebene zu berechnen. Fehlercode GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION"},{"location":"R_GE_P_NON_PLANAR/#implementierung","title":"Implementierung","text":"<p>In CityDoctor2 ist nur die Abstandspr\u00fcfung standardm\u00e4\u00dfig aktiv, da die Normalenpr\u00fcfung keine deterministischen Ergebnisse liefert.</p>"},{"location":"R_GE_P_NON_PLANAR/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0002-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK f\u00fcr diese Anforderung, GE_S_NOT_CLOSED Fehler in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0002-T0002 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE in _Simple_BD.1_PG.2 mit distanceTolerance = 0.01 GE-gml:PO-0002-T0003 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml OK f\u00fcr diese Anforderung mit distanceTolerance = 0.5, GE_P_ORIENTATION_RINGS_SAME in sp\u00e4teren Pr\u00fcfungen GE-gml:PO-0002-T0004 SimpleSolid_SrefBS-GE-gml-PO-0002-T0002.gml GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION in _Simple_BD.1_PG.1 mit Parameter type = angle"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/","title":"R_GE_P_ORIENTATION_RINGS_SAME","text":""},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#anforderung","title":"Anforderung","text":"ID R_GE_P_ORIENTATION_RINGS_SAME Beschreibung \u00c4u\u00dfere und innere Ringe d\u00fcrfen nicht die selbe Orientierung haben. Fehlercode GE_P_ORIENTATION_RINGS_SAME <p>Beispiel :  </p>"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_P_ORIENTATION_RINGS_SAME Anforderungs ID R_GE_P_ORIENTATION_RINGS_SAME Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR Beschreibung Fehlercode GE_P_ORIENTATION_RINGS_SAME"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:PO-0006-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK GE-gml:PO-0006-T0002 SimpleSolid_SrefBS-GE-gml-PO-0006-T0001.gml GE_P_ORIENTATION_RINGS_SAME in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_R_COLLAPSED_TO_LINE/","title":"R_GE_R_COLLAPSED_TO_LINE","text":""},{"location":"R_GE_R_COLLAPSED_TO_LINE/#anforderung","title":"Anforderung","text":"ID R_GE_R_COLLAPSED_TO_LINE Beschreibung Ein Spezialfall von Selbstverschneidung (GE_R_SELF_INTERSECTION): Der Ring ist eine Linie. Wenn der Ring einen Punkt darstellt, dann wird dies durch die Anforderungen GE_R_TOO_FEW_POINTS / GE_R_CONSECUTIVE_POINTS_SAME gepr\u00fcft ob es sich hierbei um einen Fehler handelt. Fehlercode GE_R_SELF_INTERSECTION, GE_R_COLLAPSED_TO_LINE, GE_R_TOO_FEW_POINTS, GE_R_CONSECUTIVE_POINTS_SAME"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_COLLAPSED_TO_LINE Anforderungs ID R_GE_R_COLLAPSED_TO_LINE Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Beschreibung Ring als ein Punkt kann nicht passieren, wegen den Vorbedingungen. Fehlercode GE_R_COLLAPSED_TO_LINE <p>Die Anforderung ist erf\u00fcllt mit R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED und R_GE_R_SELF_INTERSECTION und ben\u00f6tigt demnach keine eigene Implementierung.</p>"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0005-T0001 GE-gml:LR-0005-T0001.gml GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/","title":"R_GE_R_CONSECUTIVE_POINTS_SAME","text":""},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#anforderung","title":"Anforderung","text":"ID R_GE_R_CONSECUTIVE_POINTS_SAME Beschreibung Punkte innerhalb eines Rings sollen sich nicht wiederholen (ausgenommen der erste und der letzte im Fall von GML, siehe R_GE_R_NOT_CLOSED). Dieser Fehler tritt oft auf, wenn zwei Punkte an derselben Stelle sind. Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_R_CONSECUTIVE_POINTS_SAME <p>Zum Beispiel dieser Ring ist fehlerhaft:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Dieser Ring ist auch Fehlerhaft mit dem Parameter minVertexDistance = 0.1</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.05 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Das n\u00e4chste Beispiel zeigt einen fehlerhaften Ring mit einem Punkt, der zwei mal vorkommt aber die Wiederholung nicht aufeinanderfolgend ist. Dies resultiert in einer Selbstverschneidung, dies ist mit dieser Anforderung nicht abgedeckt.</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_CONSECUTIVE_POINTS_SAME Anforderungs ID R_GE_R_CONSECUTIVE_POINTS_SAME Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Beschreibung Pr\u00fcft ob sich ein Punkt wiederholt Fehlercode GE_R_CONSECUTIVE_POINTS_SAME ID C_GE_R_DUPLICATE_POINT Anforderungs ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (teilweise) Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Beschreibung Erkennt aufeinanderfolgende als auch andere wiederholende Punkte. Fehlercode GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0002-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0001.gml GE_R_CONSECUTIVE_POINTS_SAME in Ring:_Simple_BD.1_PG.6_LR.1 GE-gml:LR-0002-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml OK nach dieser Anforderung, aber hat Fehler GE_R_SELF_INTERSECTION erkannt von C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0004 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml OK nach dieser Anforderung, aber hat Fehler GE_R_SELF_INTERSECTION erkannt von C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0005 SimpleSolid_SrefBS-GE-gml-LR-0002-T0004.gml GE_R_CONSECUTIVE_POINTS_SAME in Ring:_Simple_BD.1_PG.6_LR.1 mit Parameter minVertexDistance = 0.1, GE_S_NOT_CLOSED Fehler wenn minVertexDistance = 0.01 GE-gml:LR-0002-T0006 SimpleSolid_SrefBS-GE-gml-LR-0002-T0005.gml Nicht ausgef\u00fchrt da GE_R_TOO_FEW_POINTS in Ring:_Simple_BD.1_PG.6_LR.1"},{"location":"R_GE_R_NOT_CLOSED/","title":"R_GE_R_NOT_CLOSED","text":""},{"location":"R_GE_R_NOT_CLOSED/#anforderung","title":"Anforderung","text":"ID R_GE_R_NOT_CLOSED Beschreibung Der erste und letzte Punkt m\u00fcssen in GML der gleiche sein. Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_R_NOT_CLOSED <p>Zum Beispiel dieser Ring ist fehlerhaft:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>OK mit Parameter minVertexDistance = 0.1:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.05&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_NOT_CLOSED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_NOT_CLOSED Anforderungs ID R_GE_R_NOT_CLOSED Vorbedingungen R_SC_SCHEMA_VALIDATION Beschreibung Der erste und letzte Punkt innerhalb eines Rings sollen der gleiche sein. Fehlercode GE_R_NOT_CLOSED"},{"location":"R_GE_R_NOT_CLOSED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0003-T0002 SimpleSolid_SrefBS-GE-gml-LR-0003-T0001.gml GE_R_NOT_CLOSED GE-gml:LR-0003-T0003 SimpleSolid_SrefBS-GE-gml-LR-0003-T0002.gml OK mit Parameter minVertexDistance = 0.1"},{"location":"R_GE_R_SELF_INTERSECTION/","title":"R_GE_R_SELF_INTERSECTION","text":""},{"location":"R_GE_R_SELF_INTERSECTION/#anforderung","title":"Anforderung","text":"ID R_GE_R_SELF_INTERSECTION Beschreibung Ein Ring soll einfach sein, also sich nicht selbstverschneiden. Die Selbstverschneidung kann an einem konkreten Punkt sein, oder auch nicht. Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen. Dieser Parameter wird auch dazu verwendet um zu bestimmen wann ein Punkt eine Kante ber\u00fchrt. Fehlercode GE_R_SELF_INTERSECTION <p>Beispiele f\u00fcr Selbstverschneidungen:</p> <p>Schleife: </p> <p>Punkt ber\u00fchrt Kante mit Parameter minVertexDistance: </p> <p>Doppelte Punkte: </p> <p>Doppelte Kante (Gleich wie doppelte Punkte): </p>"},{"location":"R_GE_R_SELF_INTERSECTION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_SELF_INTERSECTION Anforderungs ID R_GE_R_SELF_INTERSECTION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Beschreibung Erkennt doppelte Punkte und Selbstverschneidende Kanten. Fehlercodes GE_R_SELF_INTERSECTION ID C_GE_R_DUPLICATE_POINT Anforderungs ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (teilweise) Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_NOT_CLOSED Beschreibung Erkennt wiederholende und nicht wiederholende doppelte Punkte. Letzteres ist eine Selbstverschneidung. Fehlercodes GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_SELF_INTERSECTION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0004-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0004-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml Doppelte Punkte (Beispiel, nicht representativ f\u00fcr Fehler in Modell):GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml Doppelte Punkte (resultiert in einer doppelten Kante)GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0004 SimpleSolid_SrefBS-GE-gml-LR-0004-T0004.gml Schleife (Beispiel, nicht representativ f\u00fcr Fehler in Modell): GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0005 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml Ber\u00fchrender Punkt mit Parameter minVertexDistance = 0.1: GE_R_SELF_INTERSECTION in Ring: _Simple_BD.1_PG.2_LR.1 GE-gml:LR-0004-T0006 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml OK f\u00fcr diese Anforderung mit Parameter minVertexDistance = 0.01, GE_S_NOT_CLOSED in sp\u00e4teren Pr\u00fcfungen"},{"location":"R_GE_R_TOO_FEW_POINTS/","title":"R_GE_R_TOO_FEW_POINTS","text":""},{"location":"R_GE_R_TOO_FEW_POINTS/#anforderung","title":"Anforderung","text":"ID R_GE_R_TOO_FEW_POINTS Beschreibung Ein Ring muss mindestens 3 Punkte haben. F\u00fcr GML-Ringe ignoriert diese Anforderung die Tatsache, dass der erste und der letzte Punkt gleich sind (siehe R_GE_R_NOT_CLOSED).  Ein GML-Ring ist nach dieser Anforderung valide, wenn er mindestens 3 unterschiedliche Punkte enth\u00e4lt, aber er ist dann nicht geschlossen (die Anforderung R_GE_R_NOT_CLOSED ist nicht erf\u00fcllt). Parameter minVertexDistance Punkte k\u00f6nnen als gleich angesehen werden, trotz (kleiner) Abst\u00e4nde, siehe Vertex Anforderungen Fehlercode GE_R_TOO_FEW_POINTS <p>Zum Beispiel, dieser Ring ist fehlerhaft:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Valide Ringe:</p> <p>(Dieser Ring ist nicht geschlossen, hat aber genug unterschiedliche Punkte, um dieser Anforderung zu gen\u00fcgen.)</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_TOO_FEW_POINTS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_R_TOO_FEW_POINTS Anforderungs ID R_GE_R_TOO_FEW_POINTS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED Beschreibung Ring muss mindestens 3 unterschiedliche Punkte beinhalten Fehlercode GE_R_TOO_FEW_POINTS"},{"location":"R_GE_R_TOO_FEW_POINTS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:LR-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0001-T0002 SimpleSolid_SrefBS-GE-gml-LR-0001-T0001.gml GE_R_TOO_FEW_POINTSin Ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0001-T0003 SimpleSolid_SrefBS-GE-gml-LR-0001-T0002.gml Pr\u00fcfung nicht ausgef\u00fchrt da GE_R_NOT_CLOSEDRing _Simple_BD.1_PG.6_LR.1 ist nicht geschlossen, hat aber 3 Punkte."},{"location":"R_GE_SO/","title":"R_GE_SO","text":""},{"location":"R_GE_SO/#anforderung","title":"Anforderung","text":"ID R_GE_SO Beschreibung Ein Solid ist eine Sammlung von Polygonen mit Einschr\u00e4nkungen. Die Geometrie muss 'wasserdicht' sein. Siehe die Definition von Solids in Anhang A des CityGML QIE. Ein Solid ist g\u00fcltig, wenn die Anforderungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION, R_GE_S_SELF_INTERSECTION erf\u00fcllt sind. Fehlercode --"},{"location":"R_GE_SO/#prufung","title":"Pr\u00fcfung","text":"<p>keine weitere Pr\u00fcfung notwendig</p>"},{"location":"R_GE_SO/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis <p>Existierende Testf\u00e4lle der einzelnen Pr\u00fcfungen k\u00f6nnen verwendet werden.</p>"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/","title":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#anforderung","title":"Anforderung","text":"ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Beschreibung Alle Polygone haben die falsche Orientierung (definiert in GE_S_POLYGON_WRONG_ORIENTATION), so dass alle Polygone nach innen zeigen. Fehlercode GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Anforderungs ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_SELF_INTERSECTION, GE_S_POLYGON_WRONG_ORIENTATION Beschreibung Fehlercode GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0008-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0008-T0002 SimpleSolid_SrefBS-GE-gml-SO-0008-T0001.gml GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/","title":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS","text":""},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#anforderung","title":"Anforderung","text":"ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Beschreibung 1+ Polygone sind nicht mit derselben H\u00fclle verbunden. Fehlercode GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_MULTIPLE_CONNECTED_COMPONENTS Anforderungs ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Erstelle einen doppelten Graphen (Polygone werden Knoten, Polygone, die eine Kante teilen werden im Graph verbunden). Wenn der Graph nicht verbunden ist, gibt es mehrere verbundene Komponenten. Fehlercode GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0005-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0005-T0002 SimpleSolid_SrefBS-GE-gml-SO-0005-T0001.gml GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/","title":"R_GE_S_NON_MANIFOLD_EDGE","text":""},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#anforderung","title":"Anforderung","text":"ID R_GE_S_NON_MANIFOLD_EDGE Beschreibung Jede Kante sollte genau 2 Polygone begrenzen. Fehlercode GE_S_NON_MANIFOLD_EDGE Kommentar Diese Anforderung ist \u00e4hnlich zu GE_S_NOT_CLOSED: Wenn eine Kante mehr als 2 Polygone begrenzt, dann ist es ein GE_S_NON_MANIFOLD_EDGE Fehler. Wenn eine Kante nur ein Polygon begrenzt, ist es ein GE_S_NOT_CLOSED Fehler (ein Loch im Solid)"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_NON_MANIFOLD_EDGE Anforderungs ID R_GE_S_NON_MANIFOLD_EDGE Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Fehlercode GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0004-T0000 SimpleSolid_SrefBS.gml OK GE-gml:SO-0004-T0001 SimpleSolid_SrefBS-GE-gml-SO-0004-T0001.gml GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/","title":"R_GE_S_NON_MANIFOLD_VERTEX","text":""},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#anforderung","title":"Anforderung","text":"ID R_GE_S_NON_MANIFOLD_VERTEX Beschreibung Jedes Polygon das an einem Punkt eines Solids anliegt muss \u00fcber Kanten mit den anderen anliegenden Polygonen verbunden sein. Punkt und anliegende Polygone m\u00fcssen ein 'Regenschirm' erzeugen. Fehlercode GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_NON_MANIFOLD_VERTEX Anforderungs ID R_GE_S_NON_MANIFOLD_VERTEX Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Fehlercode GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0003-T0002 SimpleSolid_SrefBS-GE-gml-SO-0003-T0001.gml GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NOT_CLOSED/","title":"R_GE_S_NOT_CLOSED","text":""},{"location":"R_GE_S_NOT_CLOSED/#anforderung","title":"Anforderung","text":"ID R_GE_S_NOT_CLOSED Beschreibung Die H\u00fclle darf keine L\u00f6cher haben, sie muss Wasserdicht sein. Fehlercode GE_S_NOT_CLOSED"},{"location":"R_GE_S_NOT_CLOSED/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_NOT_CLOSED Anforderungs ID R_GE_S_NOT_CLOSED Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Beschreibung Fehlercode GE_S_NOT_CLOSED <p>Die Pr\u00fcfung sucht alle Kanten und ordnet sie den jeweiligen Gegenkanten zu. Falls eine Kante keine Gegenkante hat so wird hier ein Loch in der H\u00fclle erkannt und ein Fehler herausgegeben.</p>"},{"location":"R_GE_S_NOT_CLOSED/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0002-T0002 SimpleSolid_SrefBS-GE-gml-SO-0002-T0001.gml GE_S_NOT_CLOSED"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/","title":"R_GE_S_POLYGON_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#anforderung","title":"Anforderung","text":"ID R_GE_S_POLYGON_WRONG_ORIENTATION Beschreibung Ein Polygon muss so orientiert sein, dass die Normale des \u00e4u\u00dferen Rings nach au\u00dfen zeigt. Die Punkte sind gegen den Uhrzeigersinn angeordnet. Fehlercode GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_POLYGON_WRONG_ORIENTATION Anforderungs ID R_GE_S_POLYGON_WRONG_ORIENTATION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_EDGE Beschreibung Fehlercode GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0007-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0007-T0002 SimpleSolid_SrefBS-GE-gml-SO-0007-T0001.gml GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_SELF_INTERSECTION/","title":"R_GE_S_SELF_INTERSECTION","text":""},{"location":"R_GE_S_SELF_INTERSECTION/#anforderung","title":"Anforderung","text":"ID R_GE_S_SELF_INTERSECTION Beschreibung Der Solid darf sich nicht selbstverschneiden Fehlercode GE_S_SELF_INTERSECTION <p>Beispiel (links = OK, rechts = Fehlerhaft):  </p>"},{"location":"R_GE_S_SELF_INTERSECTION/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_SELF_INTERSECTION Anforderungs ID R_GE_S_SELF_INTERSECTION Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION Beschreibung Fehlercode GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_SELF_INTERSECTION/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0006-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0006-T0002 SimpleSolid_SrefBS-GE-gml-SO-0006-T0001.gml GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_TOO_FEW_POLYGONS/","title":"R_GE_S_TOO_FEW_POLYGONS","text":""},{"location":"R_GE_S_TOO_FEW_POLYGONS/#anforderung","title":"Anforderung","text":"ID R_GE_S_TOO_FEW_POLYGONS Beschreibung Solids m\u00fcssen mindestens 4 Polygone haben. Fehlercode GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#prufung","title":"Pr\u00fcfung","text":"ID C_GE_S_TOO_FEW_POLYGONS Anforderungs ID R_GE_S_TOO_FEW_POLYGONS Vorbedingungen R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL Beschreibung Fehlercode GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#testfalle","title":"Testf\u00e4lle","text":"Testfall ID CityGML Modell Erwartetes Ergebnis GE-gml:SO-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0001-T0002 SimpleSolid_SrefBS-GE-gml-SO-0001-T0001.gml GE_S_TOO_FEW_POLYGONS"},{"location":"basic/","title":"Validierung von 3D Stadtmodellen in CityGML","text":""},{"location":"basic/#begriffe-und-definitionen","title":"Begriffe und Definitionen","text":"<p>nach CityGML Quality Interoperability Experiment, chapter 3</p> <p>Validierung</p> <p>Prozess des validierens einer CityGML Datei nach spezifizierten Anforderungen. Eine valide Datei entspricht allen Anforderungen.</p> <p>Anforderungen</p> <p>Regeln und Einschr\u00e4nkungen, die die Datenstruktur eindeutig definieren. Anforderungen k\u00f6nnen von dem CityGML Standard Dokument abgleitet werden oder gesondert, als Anforderung an den CityGML Standard, definiert werden um Mehrdeutigkeiten des Standards zu verhindern oder zus\u00e4tzliche nutzerabh\u00e4ngige Anforderungen zu definieren.</p> <p>Pr\u00fcfung</p> <p>Algorithmische Implementation um eine Anforderung innerhalb eines Validerungsprogramms zu pr\u00fcfen.</p> <p>Fehler</p> <p>Ergebnis einer Pr\u00fcfung im Falle einer Nichtkonformit\u00e4t von Anforderungen.</p> <p>Validierungsplan</p> <p>Strukturierte Liste von Anforderungen, \u00fcberlicherweise angepasst an den konkreten Fall.</p>"},{"location":"basic/#zusatzliche-defintionen","title":"Zus\u00e4tzliche Defintionen:","text":"<p>XSD valide</p> <p>Eine CityGML Datei XSD valide wenn sie dem CityGML XML Schema entspricht.</p>"},{"location":"firstRun/","title":"Erster Start","text":""},{"location":"firstRun/#start","title":"Start","text":"<p>Nach dem entpacken der Zip Datei sollte je nach Version (GUI oder Batch) eine Struktur \u00e4hnlich diesem Bild rauskommen (Beispiel CityDoctorGUI): </p> <p>Um CityDoctor zu starten kann die start.bat verwendet werden.</p> <p>Die .bat Datei enth\u00e4lt dabei nur den Befehl:</p> <pre><code>java -classpath app/*;plugins/* de.hft.stuttgart.citydoctor2.gui.CityDoctorGUIStarter\n</code></pre> <p>Note</p> <p>Der Befehl hat sich \u00fcber die Versionshistorie von CityDoctor ver\u00e4ndert.</p> <p>F\u00fcr die Batch Version ist der Befehl analog und kann entsprechend f\u00fcr andere Betriebsysteme angepasst werden.</p> <p>Note</p> <p>F\u00fcr Linux oder Mac kann dieser Befehl auch verwendet werden, es muss nur das \";\" durch \":\" ersetzt werden. Der Rest bleibt gleich.</p>"},{"location":"geometric/","title":"Geometrieanforderungen","text":""},{"location":"geometric/#fehlercodes-fur-geometrische-fehler","title":"Fehlercodes f\u00fcr geometrische Fehler","text":"<p>Die Fehlercodes wurden \u00fcbernommen aus dem CityGML Quality Interoperability Experiment, chapter 7.5.</p> <p>Note</p> <p>Die Anforderungen wurden in CityDoctor umbenannt um einen auch von Menschen zu verstehenden Begriff, analog zu den Fehlercodes, darzustellen.</p> <p>Alle geometrischen Fehler sind in dem \"GE\" Definitionsbereich. Da geometrische Validierung basierend auf den Primitiven auf drei verschiedenen Ebenen ausgef\u00fchrt wird enth\u00e4lt jede Anforderung eine Ebene:</p> <ul> <li>Ring: R</li> <li>Polygon: P</li> <li>H\u00fclle (Shell): S</li> </ul> <p>Fehlercodes folgen dem selben Namensschema wie die Anforderungen, siehe auch Grundbegriffe. Jede Verletzung einer Anforderung muss in einem Fehler enden, der einen entsprechenden Fehlercode beinhaltet. Jeder Fehler kann (und sollte) zus\u00e4tzliche Informationen beinhalten (z.B. Wenn ein Ring nicht geschlossen ist, dann sollte die ID des Rings mitgegeben werden).</p>"},{"location":"geometric/#vertex-punkt-anforderungen","title":"Vertex (Punkt) Anforderungen","text":"<p>Zwei Punkte A und B sind gleich wenn die Euclidische-Distanz zwischen den beiden Punkten kleiner als eine definierte Gr\u00f6\u00dfe ist (minVertexDistance). Diese definierte Gr\u00f6\u00dfe findet auch in vielen Anforderungen wieder Anwendung, zum Beispiel ber\u00fchrt ein Punkt eine Kante wenn der Abstand des Punktes kleiner ist als minVertexDistance. In den folgenden Anforderungen wird die Gr\u00f6\u00dfe verwendet:</p> <ul> <li>R_GE_R_CONSECUTIVE_POINTS_SAME</li> <li>R_GE_R_NOT_CLOSED</li> <li>R_GE_R_SELF_INTERSECTION</li> <li>R_GE_P_INTERIOR_DISCONNECTED</li> </ul> <p>Die folgenden Anforderungen wurden auf den drei geometrischen Ebenen definiert (nach Ledoux (2013)):</p>"},{"location":"geometric/#linear-ring","title":"Linear Ring","text":"Anforderungs ID Beschreibung Fehlercode Bekannte Pr\u00fcfungen R_GE_R_TOO_FEW_POINTS Zu wenig Punkte in einem Ring GE_R_TOO_FEW_POINTS C_GE_R_TOO_FEW_POINTS R_GE_R_CONSECUTIVE_POINTS_SAME 2 aufeinanderfolgende Punkte sind gleich GE_R_CONSECUTIVE_POINTS_SAME C_GE_R_CONSECUTIVE_POINTS_SAME, C_GE_R_DUPLICATE_POINT R_GE_R_NOT_CLOSED Der erste und letzte Punkt sind nicht gleich GE_R_NOT_CLOSED C_GE_R_NOT_CLOSED R_GE_R_SELF_INTERSECTION Selbstverschneidung z.B. eine Schleife GE_R_SELF_INTERSECTION C_GE_R_SELF_INTERSECTION, C_GE_R_DUPLICATE_POINT R_GE_R_COLLAPSED_TO_LINE Momentan nicht in Benutzung, da redundant mit R_GE_R_SELF_INTERSECTION Ring ist ein Punkt oder eine Linie GE_R_COLLAPSED_TO_LINE C_GE_R_COLLAPSED_TO_LINE R_GE_R_ALL Container f\u00fcr: R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION -- --"},{"location":"geometric/#polygon","title":"Polygon","text":"Anforderungs ID Beschreibung Fehlercode Bekannte Pr\u00fcfungen R_GE_P_INTERSECTING_RINGS 2+ Ringe schneiden sich GE_P_INTERSECTING_RINGS C_GE_P_INTERSECTING_RINGS R_GE_P_NON_PLANAR Nicht planares Polygon, sowohl Distanz als auch Fl\u00e4chennormale Abweichungen GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION C_GE_P_NON_PLANAR R_GE_P_INTERIOR_DISCONNECTED Innenfl\u00e4che ist nicht verbunden GE_P_INTERIOR_DISCONNECTED C_GE_P_INTERIOR_DISCONNECTED R_GE_P_HOLE_OUTSIDE 1+ inneren Ringe ist komplett au\u00dferhalb des Polygons GE_P_HOLE_OUTSIDE C_GE_P_HOLE_OUTSIDE R_GE_P_INNER_RINGS_NESTED Innerer Ring ist komplett innerhalb eines anderen inneren Rings GE_P_INNER_RINGS_NESTED C_GE_P_INNER_RINGS_NESTED R_GE_P_ORIENTATION_RINGS_SAME \u00c4u\u00dferer Ring und innerer Ring haben die selbe Orientation GE_P_ORIENTATION_RINGS_SAME C_GE_P_ORIENTATION_RINGS_SAME R_GE_P_ALL Container f\u00fcr: R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME, R_GE_R_ALL -- --"},{"location":"geometric/#solid-hulle-shell","title":"Solid / H\u00fclle (Shell)","text":"Anforderungs ID Beschreibung Fehlercode Bekannte Pr\u00fcfungen R_GE_S_TOO_FEW_POLYGONS &lt;4 Polygone GE_S_TOO_FEW_POLYGONS C_GE_S_TOO_FEW_POLYGONS R_GE_S_NOT_CLOSED Die H\u00fclle ist nicht wasserdicht / hat 1+ L\u00f6cher GE_S_NOT_CLOSED C_GE_S_NOT_CLOSED R_GE_S_NON_MANIFOLD_VERTEX Jedes Polygon, das an einem Punkt anliegt muss \u00fcber Kanten mit den Anderen verbunden sein GE_S_NON_MANIFOLD_VERTEX C_GE_S_NON_MANIFOLD_VERTEX R_GE_S_NON_MANIFOLD_EDGE An jeder Kante d\u00fcrfen nur 2 Polygon anliegen GE_S_NON_MANIFOLD_EDGE C_GE_S_NON_MANIFOLD_EDGE R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Alle Polygone m\u00fcssen \u00fcber Punkte und Kanten verbunden sein GE_S_MULTIPLE_CONNECTED_COMPONENTS C_GE_S_MULTIPLE_CONNECTED_COMPONENTS R_GE_S_SELF_INTERSECTION Die H\u00fclle selbstverschneidet sich GE_S_SELF_INTERSECTION C_GE_S_SELF_INTERSECTION R_GE_S_POLYGON_WRONG_ORIENTATION Die Orientierung eines Polygons ist falsch GE_S_POLYGON_WRONG_ORIENTATION C_GE_S_POLYGON_WRONG_ORIENTATION R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Alle Polygone zeigen in die falsche Richtung GE_S_ALL_POLYGONS_WRONG_ORIENTATION C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION R_GE_S_ALL Container f\u00fcr: R_GE_S_TOO_FEW_POLYGONS, R_GE_S_NOT_CLOSED, R_GE_S_NON_MANIFOLD_VERTEX, R_GE_S_NON_MANIFOLD_EDGE, R_GE_S_MULTIPLE_CONNECTED_COMPONENTS, R_GE_S_SELF_INTERSECTION, R_GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION -- --"},{"location":"geometric/#parameter-uberblick","title":"Parameter \u00dcberblick","text":"Name Beschreibung Verwendet in Einheit minVertexDistance Minimale Abstand zwischen zwei Punkten bevor sie als der selbe Punkt angesehen werden R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_P_INTERIOR_DISCONNECTED Meter type Planarit\u00e4tspr\u00fcfungsart, kann distance, angle, both sein R_GE_P_NON_PLANAR - distanceTolerance Maximale Distanz eines Punktes von der Ausgleichsebene eines Polygons bevor es als Fehler angesehen wird R_GE_P_NON_PLANAR Meter angleTolerance Maximale Differenz im Winkel von angrenzenden Dreiecken einer Triangulierung bevor ein Polygon nicht mehr als Planar angesehen wird R_GE_P_NON_PLANAR Radiant"},{"location":"geometric/#abhangigkeitsbaum","title":"Abh\u00e4ngigkeitsbaum","text":"<p>Dies ist die Reihenfolge in der die Pr\u00fcfungen ausgef\u00fchrt werden. Wenn eine abh\u00e4ngige Pr\u00fcfung einen Fehler geworfen hat oder nicht ausgef\u00fchrt wurde, so wird die darauffolgende Pr\u00fcfung auch nicht ausgef\u00fchrt.</p> <pre><code>graph TD;\n  X0001[R_SC_SCHEMA_VALIDATION]\n  R0001[R_GE_R_TOO_FEW_POINTS]\n  R0002[R_GE_R_CONSECUTIVE_POINTS_SAME]\n  R0003[R_GE_R_NOT_CLOSED]\n  R0004[R_GE_R_SELF_INTERSECTION]\n  P0001[R_GE_P_INTERSECTING_RINGS]\n  P0002[R_GE_P_NON_PLANAR]\n  P0003[R_GE_P_INTERIOR_DISCONNECTED]\n  P0004[R_GE_P_HOLE_OUTSIDE]\n  P0005[R_GE_P_INNER_RINGS_NESTED]\n  P0006[R_GE_P_ORIENTATION_RINGS_SAME]\n\n  S0001[R_GE_S_TOO_FEW_POLYGONS]\n  S0002[R_GE_S_NOT_CLOSED]\n  S0003[R_GE_S_NON_MANIFOLD_VERTEX]\n  S0004[R_GE_S_NON_MANIFOLD_EDGE]\n  S0005[R_GE_S_MULTIPLE_CONNECTED_COMPONENTS]\n  S0006[R_GE_S_SELF_INTERSECTION]\n  S0007[R_GE_S_POLYGON_WRONG_ORIENTATION]\n  S0008[R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION]\n\n  X0001--&gt;R0003;\n  R0003--&gt;R0001;\n  R0001--&gt;R0002;\n  R0002--&gt;R0004;\n  R0004--&gt;P0002;\n  P0002--&gt;P0006;\n  P0006--&gt;P0003;\n  P0006--&gt;P0004;\n  P0006--&gt;P0005;\n  P0004--&gt;P0001;\n  P0005--&gt;P0001;\n  P0001--&gt;S0001;\n  P0003--&gt;S0001;\n  S0001--&gt;S0002;\n  S0001--&gt;S0004;\n  S0001--&gt;S0003;\n  S0001--&gt;S0005;\n  S0002--&gt;S0007;\n  S0004--&gt;S0007;\n  S0007--&gt;S0006;\n  S0003--&gt;S0006;\n  S0005--&gt;S0006;\n  S0006--&gt;S0008; \n</code></pre>"},{"location":"geometric/#multisurface-und-solid-geometrie","title":"Multisurface und Solid Geometrie","text":"<p>Um die Definition eines Validierungsplans zu vereinfachen werden zwei neue Anforderungen zus\u00e4tzlich eingef\u00fchrt. Diese Anforderungen dienen lediglich zur Gruppierung von den vorhandenen Anforderungen und ben\u00f6tigen keine zus\u00e4tzlichen Pr\u00fcfungen.</p> Anforderungs ID Beschreibung Abh\u00e4ngigkeiten Fehlercode Bekannte Pr\u00fcfungen R_GE_MS Valide Multisurface-Geometrie R_SC-SCHEMA-VALIDATION, R_GE_P_ALL -- -- R_GE_SO Valide H\u00fcllengeometrie R_SC-SCHEMA-VALIDATION, R_GE_S_ALL -- --"},{"location":"qual_ade/","title":"Quality-ADE","text":"<p>CityDoctor benutzt die Quality-ADE</p>"},{"location":"requiredSoftware/","title":"Ben\u00f6tigte Software","text":""},{"location":"requiredSoftware/#versionen-ab-3130","title":"Versionen ab 3.13.0","text":"<p>Ab Version 3.13.0 wurde ein Repository auf dem Transferportal der Hochschule erstellt, das fortan als Ablageort f\u00fcr fertige Releases verwendet wird: https://transfer.hft-stuttgart.de/gitlab/citydoctor/citydoctorreleases</p> <p>Die Versionen sind dort unterteilt zwischen CityDoctorValidation und CityDoctorGUI und unter diesen Ordnern gibt es die entsprechenden Versionsordner.</p>"},{"location":"requiredSoftware/#releaseversionen","title":"Releaseversionen","text":"<p>F\u00fcr jede CityDoctor Variante (CityDoctorValidation oder CityDoctorGUI) werden vier verschiedene Versionen zum Download bereitgestellt. Es werden in verschiedenen Versionen Java Runtimes der Liberica Distribution mitgeliefert. </p> Version Beschreibung CityDoctor*-no-runtime.zip Diese Version beinhaltet keine Runtime f\u00fcr Java. Falls auf Ihrem PC schon ein Java der Version 17 installiert ist (siehe Java), dann ist diese Version zu bevorzugen. CityDoctor*-win.zip Beinhaltet eine Windows Java Runtime zum ausf\u00fchren von CityDoctor, kein Java muss installiert sein. CityDoctor*-lin.zip Beinhaltet eine Linux Java Runtime zum ausf\u00fchren von CityDoctor CityDoctor*-mac.zip Beinhaltet eine Mac Java Runtime zum ausf\u00fchren von CityDoctor"},{"location":"requiredSoftware/#versionen-bis-312x","title":"Versionen bis 3.12.x","text":"<p>CityDoctor kann von verschiedenen Seiten heruntergeladen werden. Die aktuellste Stelle ist ein gitlab Repository. Alternativ werden Releases auch auf der CityDoctor Homepage der BHT gelistet. Es gibt dabei immer zwei Versionen:</p> <ul> <li>CityDoctorGUI-3.x.x.zip: Das ist die grafische Oberfl\u00e4che inklusive der Pr\u00fcfungen. Geeignet f\u00fcr den Endnutzer auf einem Desktop PC.</li> <li>CityDoctorValidation-3.x.x.zip: Das ist die Batch-Version die f\u00fcr die Integration in Servern oder anderen bestehenden Systemen geeignet ist und hat keine grafische Oberfl\u00e4che sondern arbeitet Dateibasiert als Prozess.</li> </ul> <p>Note</p> <p>Es gibt manchmal Spezialversionen die Testweise erstellt worden sind um verschiedene Auslieferungsm\u00f6glichkeiten zu testen. Bsp: CityDoctorGUI-x.x.x-win.zip beinhaltet die JavaFX Bibliotheken sodass eine Java Umgebung ohne JavaFX auch verwendet werden kann.</p>"},{"location":"requiredSoftware/#java","title":"Java","text":"<p>Vor der CityDoctor Version 3.12.x wird Java 8 entweder als JDK oder als JRE ben\u00f6tigt. Ab der Version 3.12.x wird Java 17 ben\u00f6tigt.</p> <p>Warning</p> <p>Es wichtig, dass die installierte Java Version die JavaFX Bibliotheken mit einschlie\u00dft. Diese werden f\u00fcr die grafische Oberfl\u00e4che ben\u00f6tigt.</p> <p>Die Liberica JRE oder JDK hat sich f\u00fcr einen Einsatz mit CityDoctor bew\u00e4hrt.</p> <p>Note</p> <p>Die Liberica Distribution ist zu 100% frei und OpenSource.</p> <p>Note</p> <p>F\u00fcr die Entwicklung mit CityDoctor wird eine JDK ben\u00f6tigt.</p>"},{"location":"requirements/","title":"Anforderungen und Pr\u00fcfungen f\u00fcr die Validierung von CityGML-Modellen","text":"<p>Die Anforderungen sind die Grundbausteine f\u00fcr ein Validierungsplan um CityGML-Modelle zu validieren. F\u00fcr Namenskonventionen und Definitionen, siehe Grundbegriffe.  </p> <p>Eine Anforderung kann durch einen oder mehrere Pr\u00fcfungen validiert werden. Eine Pr\u00fcfung validiert ein oder mehrere Anforderungen bei einem Modell. Jede Pr\u00fcfung kann Vorbedingungen haben. Wenn diese Vorbedingungen nicht erf\u00fcllt sind wird die Pr\u00fcfung nicht ausgef\u00fchrt.</p> <p>Unterschieden wird dabei zwischen:</p> <ul> <li>Schemaanforderungen</li> <li>Geometrieanforderungen</li> <li>Semantische Anforderungen</li> </ul>"},{"location":"schemaRequirements/","title":"Schemaanforderungen","text":""},{"location":"schemaRequirements/#r_sc_schema_validation","title":"R_SC_SCHEMA_VALIDATION","text":""},{"location":"schemaRequirements/#anforderung","title":"Anforderung","text":"ID R_SC_SCHEMA_VALIDATION Beschreibung Eine grundlengende Anforderung ist, dass jedes CityGML Dokument wohl definiert sein muss und XSD valide ist. Fehlercode SC-SCHEMA-NOT-VALID"},{"location":"schemaRequirements/#prufung","title":"Pr\u00fcfung","text":"ID SC_SCHEMA_VALIDATION Anforderungs ID R_SC_SCHEMA_VALIDATION Vorbedingungen keine Beschreibung Werkzeuge um eine XSD Validierung durchzuf\u00fchren sind verf\u00fcgbar und geben verl\u00e4ssliche Ergebnisse Fehlercode SC_SCHEMA_NOT_VALID"},{"location":"semantic/","title":"Semantische Anforderungen","text":"<p>Die semantischen Anforderungen sind meistens auf Attributbasis. Daraus ergeben sich 3 Fehlerzust\u00e4nde f\u00fcr ein Attribut:</p> <ul> <li>SE_ATTRIBUTE_WRONG_VALUE: Wenn ein Attribut ein falschen Wert hat.</li> <li>SE_ATTRIBUTE_MISSING: Wenn ein Attribut fehlt, aber vorhanden sein sollte.</li> <li>SE_ATTRIBUTE_INVALID: Wenn ein Attribut vorhanden ist aber verboten ist.</li> </ul>"},{"location":"semantic/#schematron","title":"Schematron","text":"<p>In CityDoctor wurde das XML Validierungssystem Schematron integriert um flexibel Attributpr\u00fcfungen anzupassen und zu unterst\u00fctzen. </p> <p>Hier ist ein Beispiel f\u00fcr eine Schematron Datei die CityDoctor integrieren kann:</p>"},{"location":"semantic/#citydoctor-3130","title":"CityDoctor &gt;= 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n\n</code></pre>"},{"location":"semantic/#citydoctor-3130_1","title":"CityDoctor &lt; 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n</code></pre> <p>Diese Datei pr\u00fcft, dass alle Buildings in sich selbst oder in einem ihrer Unterelementen ein Solid beliebigen LODSs vorhanden ist. Au\u00dferdem stellt die Datei sicher, dass jedes BuildingPart ein Solid enth\u00e4lt. Wenn dies nicht der Fall ist wird eine Fehlermeldung ausgegeben. Die Fehlermeldung ist dabei so formattiert, dass CityDoctor sie interpretieren und in das interne Datenmodell einbinden kann.</p>"},{"location":"semantic/#fehlerformat","title":"Fehlerformat","text":"<p>Das Fehlerformat ist ein CSV-Format mit || als Trennzeichen</p> <pre><code>parent id||child id||error code||error type||is generic attribute\n</code></pre> <p>Die Fehlermeldung besteht aus den folgenden Teilen:</p> <ul> <li>Die <code>parent id</code> ist die gml id des obersten Elements z.B. Building oder Bridge. </li> <li>Falls der Fehler in einem Unterelement aufgetreten ist so kann diese ID in dem Feld f\u00fcr die <code>child id</code> eingetragen werden.</li> <li>Im Feld <code>error type</code> ist einer der 3 Fehlertypen einzutragen: <code>SE_ATTRIBUTE_WRONG_VALUE, SE_ATTRIBUTE_MISSING, SE_ATTRIBUTE_INVALID</code>.</li> </ul> <p>note Nur in CityDoctor &lt; 3.13.0: * Um ein generisches Attribut mit dem Namen <code>measuredHeight</code> von dem nicht generischen Attribut zu unterscheiden ist im letzten Feld vorgesehen <code>true</code> einzutragen wenn es sich um ein generisches Attribut handelt ansonsten <code>false</code>. </p>"},{"location":"udt_about/","title":"UDigiT-Doctor","text":"<p>Erweiterung des CityDoctor2 f\u00fcr die Integration von urbanen digitalen Zwillingen</p> <p></p> <p>Das UDigiT-Doctor Projekt sieht eine Weiterentwicklung des CityDoctor2 vor, mit dem Ziel die Pr\u00fcfung von urbanen digitalen Zwillingen durch die Validierungs- und Reparaturfunktionen des CityDoctors zu erm\u00f6glichen.</p>"},{"location":"udt_about/#fragestellung","title":"Fragestellung","text":"<p>Zusammengefasst k\u00f6nnen f\u00fcr eine \u00dcbertragung der Qualit\u00e4tssicherung von Geb\u00e4udemodellen auf UDT folgende wissenschaftliche und technische Schwerpunkteziele abgeleitet werden:</p> <ul> <li>Entwurf einer internen Datenstruktur und Erarbeitung von Verfahren zur Erzeugung eines integrierten Gesamtmodells </li> <li>\u00dcberpr\u00fcfung der topologischen Beziehungen von Objekten sowohl zur Sicherstellung grundlegender Eigenschaften eines allgemein verwendbaren Basis-Modells als auch f\u00fcr ausgew\u00e4hlte Anwendungsszenarien (Leitungsnetze, Geb\u00e4udeanschl\u00fcsse, etc.)</li> <li>Erweiterung des Pr\u00fcf- und Reparaturprozesses durch Vergleichsmethoden unter Verwendung von Referenzmodellen</li> <li>Umfassende und konfigurierbare Semantikpr\u00fcfung</li> </ul>"},{"location":"udt_about/#lizenz","title":"Lizenz","text":"<p>UDigiT-Doctor, bzw. CityDoctor2, wird weiterhin als FOSS unter der LGPL ver\u00f6ffentlicht.</p>"},{"location":"udt_about/#releases","title":"Releases","text":"<p>Releases von UDigiT-Doctor werden \u00fcber das GitLab Repository von CityDoctor2 verf\u00fcgbar gemacht.</p>"},{"location":"udt_about/#projektdaten","title":"Projektdaten","text":"<p>Projektlaufzeit: 01.04.2024 - 01.07.2027</p> <p>Projekt Website: UDigiT-Doctor: Hochschule f\u00fcr Technik Stuttgart UDigiT-Doctor: Berliner Hochschule f\u00fcr Technik</p> <p>Projektleitung: Prof. Dr.-Ing. Volker Coors</p> <p>Verbundpartner: Prof. Dr. Margitta Pries</p>"},{"location":"udt_about/#partner","title":"Partner","text":"<p>Kooperationspartner: Robert Bosch GmbH Geoplex GIS GmbH M.O.S.S. Computer Grafik Systeme GmbH LandPlan OS GmbH Point Cloud Technology GmbH virtualcitysystems GmbH</p> <p>Assoziative Partner: Open Geospatial Consortium Stadt Stuttgart Stadt Leverkusen </p> <p>Mittelgeber: Bundesamt f\u00fcr Bildung und Forschung</p> <p>Projekttr\u00e4ger: VDI Technologiezentrum </p>"},{"location":"udt_req_overview/","title":"Anforderungen an UDigiT-Doctor","text":"<ol> <li>Entwurf einer internen Datenstruktur und Erarbeitung von Verfahren zur Erzeugung eines integrierten Gesamtmodells.</li> <li>\u00dcberpr\u00fcfung der topologischen Beziehungen von Objekten sowohl zur Sicherstellung grundlegender Eigenschaften eines allgemein verwendbaren Basis-Modells als auch f\u00fcr ausgew\u00e4hlte Anwendungszenarien (Leitungsnetze, Geb\u00e4udeanschl\u00fcsse, ...)</li> <li>Erweiterung des Pr\u00fcf- und Reperaturprozesses durch Vergleichsmethoden unter Verwendung von Referenzmodellen</li> <li>Umfassende und konfigurierbare Semantikpr\u00fcfung</li> </ol> Spezielle Anforderungen von Relevant f\u00fcr Anforderungen Nr. Datenmodell 1., 2., 3. Topologische Konsistenz 2., 3. Semantische \u00dcberpr\u00fcfung 2., 4."},{"location":"udt_terms/","title":"Validierung von urbanen digitalen Zwillingen","text":""},{"location":"udt_terms/#begriffe-und-definitionen","title":"Begriffe und Definitionen","text":"<p>Siehe auch: Begriffe und Definitionen von CityDoctor2</p> <p>Urbaner digitaler Zwilling</p> <p>Ein urbaner digitaler Zwilling ist ein repr\u00e4sentatives, virtuelles Modell eines realen Geb\u00e4udes. Digitale Zwillinge dienen, unter anderem, der Simulation von verschiedenen Prozessen, als auch als zentraler Sammelpunkt f\u00fcr Daten und Informationen. Dies schlie\u00dft bei urbanen digitalen Zwillingen auch Daten von installierten Sensoren und Geb\u00e4udeleittechniksystemen ein.</p>"},{"location":"userInterface/","title":"Nutzeroberfl\u00e4che","text":""},{"location":"userInterface/#citydoctor","title":"CityDoctor","text":"<p>In der oberen Leiste sind folgende Schaltfl\u00e4chen in Reihenfolge:</p> <ul> <li>Laden: \u00d6ffnet den Dialog zum laden einer CityGML Datei</li> <li>Pr\u00fcfen: \u00d6ffnet den Dialog zum pr\u00fcfen einer geladenen CityGML</li> <li>Pr\u00fcfberichte: \u00d6ffnet den Dialog zum schreiben eines Pr\u00fcfprotokolls in xml oder pdf Form</li> <li>Gitternetz: Zeigt/Versteckt das Gitternetz anstatt gef\u00fcllter Polygone</li> <li>R\u00fcckseiten: Zeigt/Versteckt R\u00fcckseiten von Polygonen</li> <li>Globale Ansicht: L\u00e4dt alle Elemente einer CityGML in die Ansicht</li> <li>LODs: Schaltet einzelne LODs von der Ansicht an oder aus</li> <li>Speichern: Speichert eine CityGML Datei zur\u00fcck, falls die Datei gepr\u00fcft wurde wird die QualityADE mitgeschrieben.</li> <li>About: \u00d6ffnet den Dialog mit Informationen zu dem Projekt CityDoctor2</li> <li>Ansichten: Wechselt verschiedene Ansichten. F\u00fcr die Pr\u00fcfung gibt es nur eine.</li> <li>Sprache: Hier kann die Sprache eingestellt werden (Deutsch/Englisch)</li> </ul> <p>Warning</p> <p>Das Anzeigen der Globalen Ansicht kann bei gro\u00dfen CityGML Dateien (&gt; 100mb je nach System) zu abst\u00fcrzen f\u00fchren. Das Anzeigen kann kurz dauern.</p>"},{"location":"userInterface/#laden","title":"Laden","text":"<p>\u00dcber die Schaltfl\u00e4che Laden wird der Dialog zum laden einer CityGML Datei ge\u00f6ffnet.</p> <p></p> <p>In der Datei Leiste kann ein Dateipfad eingetragen werden oder \u00fcber die Schaltfl\u00e4che Ausw\u00e4hlen ausgew\u00e4hlt werden.</p> <p>Au\u00dferdem k\u00f6nnen weitere Einstellungen f\u00fcr das Lesen der Datei angegeben werden.</p> <ul> <li>NumberOfRoundingPlaces: Auf wie viele Nachkommastellen werden die eingelesenen Werte gerundet.</li> <li>XML-Validierung: F\u00fchrt eine XML Validierung durch. Fehler werden dabei direkt beim einlesen festgestellt und das Einlesen wird abgebrochen.</li> <li>Speicherverbrauch: Spart RAM um gr\u00f6\u00dfere Dateien in der GUI zu erm\u00f6glichen. Kostet geringf\u00fcgig Performance bei der Pr\u00fcfung.</li> </ul> <p>Beim Laden wird der Fortschritt ungef\u00e4hr durch den Ladebalken repr\u00e4sentiert.</p> <p>Note</p> <p>Dateien k\u00f6nnen auch direkt per Drag and Drop vom Dateimanager in die GUI gezogen werden ohne den Laden Dialog zu verwenden. Dabei werden die Default Werte angenommen (8 Nachkommastellen, keine XML-Validierung)</p> <p>Nach dem Laden einer CityGML Datei werden die Elemente in den einzelnen Tabs angezeigt. Durch ausw\u00e4hlen eines Elements wird das in der Ansicht angezeigt.</p> <p></p> <p>Note</p> <p>Durch Ausw\u00e4hlen des obersten Elements eines Reiters werden alle Elemente innerhalb diese Reiters angezeigt. Wie obige Warnung schon besagt, gilt auch hier, dass gr\u00f6\u00dfere Datenmengen zu Abst\u00fcrzen f\u00fchren.</p>"},{"location":"userInterface/#prufen","title":"Pr\u00fcfen","text":"<p>Im Pr\u00fcfdialog kann der Validierungsplan angepasst werden. Hier werden neben den Verf\u00fcgbaren Pr\u00fcfungen auch die globalen Parameter angezeigt.</p> <p>Ver\u00e4ndert k\u00f6nnen die Parameter mit einem Doppelklick in die Wert Spalte. Die Einheit ist dabei fest.</p> <p>Note</p> <p>Der Parameter numberOfRoundingPlaces kann nicht ver\u00e4ndert werden. Er wurde beim Laden der Datei festgelegt.</p> <p>Falls Pr\u00fcfungen nicht ausgef\u00fchrt werden sollen k\u00f6nnen sie in der Spalte Aktiv deaktiviert werden.</p> <p>Warning</p> <p>Wenn Pr\u00fcfungen deaktiviert wurden die andere aktiven Pr\u00fcfungen aber als Abh\u00e4ngigkeit ben\u00f6tigen werden sie bei der Pr\u00fcfung wieder aktiviert um die Stabilit\u00e4t zu gew\u00e4hrleisten. Siehe Anforderungen.</p> <p>In dem Feld Schematron Datei kann ein Pfad zu einer Schematron Datei eingetragen werden. In dieser Datei k\u00f6nnen flexible Regeln f\u00fcr die semantischen Anforderungen festgelegt werden. Siehe Semantische Pr\u00fcfungen</p> <p>\u00dcber die beiden Schaltfl\u00e4chen oben rechts kann der Pr\u00fcfplan gespeichert und geladen werden.</p> <p>Nach der Pr\u00fcfung werden fehlerhafte Elemente rot und fehlerfreie Elemente gr\u00fcn eingef\u00e4rbt. Bei der Auswahl eines Elements das fehler beinhaltet werden die Fehler in dem unteren Tab Fehler angezeigt. Dort kann der Fehler ausgew\u00e4hlt werden um ihn in CityDoctor anzuzeigen und weitere Informationen zu erhalten.</p> <p></p> <p>Die Elemente k\u00f6nnen mit dem Dropdown-Men\u00fc gefiltert werden um nur fehlerhafte Elemente anzuzeigen.</p>"},{"location":"userInterface/#prufberichte","title":"Pr\u00fcfberichte","text":"<p>In diesem Dialog gibt es nochmal eine \u00dcbersicht \u00fcber die Fehler in Bildform und die M\u00f6glichkeit einen xml oder pdf Bericht zu schreiben.</p> <p></p>"},{"location":"validationPlan/","title":"Validierungsplan","text":"<p>der Validierungsplan f\u00fcr CityDoctor wird in YAML angegeben.</p> <p>F\u00fcr die Version 3.12.x und neuere sieht ein Beispiel so aus:</p> <pre><code>globalParameters:\n   numberOfRoundingPlaces: 8\n   # in m\n   minVertexDistance: 0.0001\n   schematronPath: 'checkForSolid.xml'\nuseStreaming: true # (1)!\nrequirements:\n   R_GE_R_TOO_FEW_POINTS:\n      enabled: true\n   R_GE_R_NOT_CLOSED:\n      enabled: true\n   R_GE_R_CONSECUTIVE_POINTS_SAME:\n      enabled: true\n   R_GE_R_SELF_INTERSECTION:\n      enabled: true\n   R_GE_S_MULTIPLE_CONNECTED_COMPONENTS:\n      enabled: true\n   R_GE_P_INTERIOR_DISCONNECTED:\n      enabled: true\n   R_GE_P_INTERSECTING_RINGS:\n      enabled: true\n   R_GE_P_NON_PLANAR:\n      enabled: true\n      parameters:\n         # one of (\"distance\", \"angle\", \"both\")\n         type: distance\n         # in m\n         distanceTolerance: 0.01\n         # in degree\n         angleTolerance: 1\n   R_GE_P_HOLE_OUTSIDE:\n      enabled: true\n   R_GE_P_ORIENTATION_RINGS_SAME:\n      enabled: true\n   R_GE_P_INNER_RINGS_NESTED:\n      enabled: true\n   R_GE_S_TOO_FEW_POLYGONS:\n      enabled: true\n   R_GE_S_NOT_CLOSED:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_EDGE:\n      enabled: true\n   R_GE_S_POLYGON_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_VERTEX:\n      enabled: true\n   R_GE_S_SELF_INTERSECTION:\n      enabled: true\n   R_SE_BS_IS_WALL:\n      enabled: false\n      parameters:\n            lowerAngle: '45'\n            upperAngle: '135'\n   R_SE_BS_IS_FLOOR:\n      enabled: false\n   R_SE_BS_GROUND_UNFRAGMENTED:\n      enabled: false\n   R_SE_BS_IS_GROUND:\n      enabled: false\n   R_SE_BS_IS_CEILING:\n      enabled: false\n</code></pre> <ol> <li>Der Parameter <code>useStreaming</code> ist ein Schalter um eine Datei St\u00fcck f\u00fcr St\u00fcck einzulesen anstelle erst die komplette Datei zu lesen bevor die Pr\u00fcfung stattfindet. Mit dieser Einstellung k\u00f6nnen auch Dateien &gt; 2GB ohne gro\u00dfe RAM Anforderungen gepr\u00fcft werden.</li> </ol> <p>In dem Validierungsplan finden sich die selben Einstellungen wieder, die in der grafischen Oberfl\u00e4che auch aufgelistet sind.</p> <p>Unter requirements sind alle Anforderungen gelistet die gepr\u00fcft werden sollen. Dabei sind die semantischen Pr\u00fcfungen standardm\u00e4\u00dfig deaktiviert. </p>"},{"location":"zipFiles/","title":"Zip-Archive","text":"<p>CityDoctor kann Zip-Dateien einlesen und enthaltene CityGML Dateien validieren.</p>"},{"location":"zipFiles/#laden-von-zip-archiven","title":"Laden von Zip-Archiven","text":"<p>Zip-Dateien k\u00f6nnen \u00fcber den Ladedialog ausgew\u00e4hlt und importiert werden. CityDoctor durchsucht die Zip-Datei nach m\u00f6glichen CityGML Dateien</p>"},{"location":"zipFiles/#zip-eintrag-manager","title":"Zip-Eintrag Manager","text":"<p>Nachdem CityDoctor erfolgreich ein Zip-Archiv importiert hat, wird der Zip-Eintrag Manager angezeigt. Der Zip-Eintrag Manager hat folgende Schaltfl\u00e4chen:</p> <ol> <li>Modell anzeigen: Zeigt das Stadtmodell der ausgew\u00e4hlten, entpackten Datei im Hauptfenster von CityDoctor.</li> <li>Datei entpacken: Entpackt die ausgew\u00e4hlte Datei.</li> <li>Fehlerstatistik anzeigen: Zeigt die Fehlerstatistik der ausgew\u00e4hlten Datei. Nur verf\u00fcgbar bei validierten Dateien.</li> <li>Alle Dateien entpacken: Entpackt alle Dateien im Archiv.</li> <li>Alle Dateien pr\u00fcfen: \u00d6ffnet den Check-Dialog f\u00fcr die Batch-Validierung aller Dateien. Siehe Validierung f\u00fcr mehr Informationen.</li> <li>Validierungsergebnisse exportieren: Erm\u00f6glicht das Speichern der Validierungsberichte. Verf\u00fcgbar nachdem mindestens eine Datei validiert wurde.</li> </ol> <p></p> <p>Der aktuelle Status der Dateien wird mithilfe eines Farbcodes angezeigt:</p> <ul> <li>Komprimiert (Schwarz): Eine komprimierte Datei ist noch 'gezippt'.</li> <li>Entpackt (Blau): Eine entpackte Datei wurde erfolgreich in den Arbeitsspeicher geladen.</li> <li>Leeres Modell (Grau): Eine entpackte Datei, welche kein Stadtmodell oder ein Stadtmodell ohne Features beinhaltet.</li> <li>Fehlerhafte Datei (Dunkelrot): Eine Datei, welche nicht erfolgreich entpackt werden konnte. M\u00f6gliche Ursachen sind fehlerhafte CityGml Dateien, Modelle die zu gro\u00df f\u00fcr den verf\u00fcgbaren Arbeitsspeicher sind oder Probleme beim Einlesen der Datei. Der genaue Grund wird in den Metadaten angezeigt.</li> <li>Validierte Dateien mit / ohne Fehlern (Hellrot bzw. Gr\u00fcn)</li> </ul> <p>Note</p> <p>Das originale Zip-Archiv wird nicht ver\u00e4ndert, entpackte Dateien sind Kopien.</p>"},{"location":"zipFiles/#validierung","title":"Validierung","text":""},{"location":"zipFiles/#validierung-einzelner-dateien","title":"Validierung einzelner Dateien","text":"<p>Entpackte Dateien k\u00f6nnen \u00fcber das CityDoctor Hauptfenster validiert werden. Das jeweils letzte Ergebnis der Validierung von jeder Datei wird hierbei im Arbeitsspeicher behalten, bis CityDoctor geschlossen oder ein neues Zip-Archiv geladen wird.</p>"},{"location":"zipFiles/#batch-validierung","title":"Batch Validierung","text":"<p>Die \"Alle Dateien pr\u00fcfen\" Schaltfl\u00e4che \u00f6ffnet die Einstellungen f\u00fcr die Batch-Validierung. Sie kann ohne vorheriges entpacken der Dateien durchgef\u00fchrt werden und verf\u00fcgt \u00fcber zwei Vorgehensweisen:</p>"},{"location":"zipFiles/#standardmodus","title":"Standardmodus","text":"<p>Der Standardmodus f\u00fchrt die Validierung \u00fcber alle Dateien im Archiv aus. Komprimierte Dateien werden hierbei automatisch entpackt. Wie bei der Individuellen Validierung werden die Ergebnisse im Arbeitsspeicher gehalten und k\u00f6nnen mit dem CityDoctor inspiziert werden.</p>"},{"location":"zipFiles/#niedriger-arbeitsspeicherverbrauchsmodus-datenstream-modus","title":"Niedriger Arbeitsspeicherverbrauchsmodus (Datenstream Modus)","text":"<p>In diesem Modus werden Datenstreams genutzt, um die Features der Stadtmodelle einzeln einzulesen und zu validieren. Dies reduziert den ben\u00f6tigten Arbeitsspeicher, da die Dateien zur \u00fcberpr\u00fcfung nicht entpackt werden m\u00fcssen. Dies bedeutet jedoch auch, dass der Status der Dateien unver\u00e4ndert bleibt. Die Ergebnisse werden in Validierungsberichten gespeichert und k\u00f6nnen nicht in CityDoctor inspiziert werden.</p>"}]}
\ No newline at end of file

public/en/R_GE_P_NON_PLANAR/index.html

@@ -470,6 +470,8 @@
 </table>
 <p>Normal deviation: <br/>
 <img alt="normalDeviation" src="../img/normalDeviation.png"/></p>
+<p>Distance of a point to the regression plane: <br/>
+<img alt="nonPlanarDistance" src="../img/nonPlanarDistance.png"/></p>
 <h2 id="check">Check<a class="headerlink" href="#check" title="Permanent link">#</a></h2>
 <table>
 <thead>

public/en/search/search_index.json

-{"config":{"lang":["en"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"CityDoctor2","text":"<p>Development of a automatic repair system for virtual city models </p> <p>CityDoctor2 is a quality check software for 3D city models in CityGML format. CityDoctor can read CityGML 1/2 documents and since version 3.12 can also read CityGML 3 with restrictions. All check results can be output in xml or pdf form. Additionally CityDoctor implements the QualityADE to save test results directly into CityGML.</p> <p></p>"},{"location":"#licence-versions","title":"Licence / Versions","text":""},{"location":"#citydoctorvalidation","title":"CityDoctorValidation","text":"<p>The validation part of CityDoctor is freely available and open source</p>"},{"location":"#citydoctorgui","title":"CityDoctorGUI","text":"<p>The graphical interface is freely available and open source</p>"},{"location":"#citydoctorhealer","title":"CityDoctorHealer","text":"<p>The part responsible for the repair is freely available and open source. Mail to:  </p>"},{"location":"#projekts","title":"Projekts","text":"<p>CityDoctor was developed in several projects. At the moment CityDoctor is developed in the project UDigitDoctor.</p> <p>Past project:</p> <ul> <li>CityDoctor2</li> </ul>"},{"location":"R_GE_MS/","title":"R_GE_MS","text":""},{"location":"R_GE_MS/#requirement","title":"Requirement","text":"ID R_GE_MS Description A MultiSurface is a collection of polygons without further restrictions. A MultiSurface is only valid if all polygons are valid. The requirements R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_R_TOO_FEW_POINTS, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME must be satisfied Error code --"},{"location":"R_GE_MS/#check","title":"Check","text":"<p>No further checks necessary. The individual requirements have their own checks to verify them.</p>"},{"location":"R_GE_MS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result <p>Existing test cases can be used. </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/","title":"R_GE_P_HOLE_OUTSIDE","text":""},{"location":"R_GE_P_HOLE_OUTSIDE/#requirement","title":"Requirement","text":"ID R_GE_P_HOLE_OUTSIDE Description An interior ring must not be completely outside the exterior ring. Error code GE_P_HOLE_OUTSIDE <p>Example:  </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/#check","title":"Check","text":"ID C_GE_P_HOLE_OUTSIDE Requirement ID R_GE_P_HOLE_OUTSIDE Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Description Error code GE_P_HOLE_OUTSIDE"},{"location":"R_GE_P_HOLE_OUTSIDE/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0004-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0004-T0002 SimpleSolid_SrefBS-GE-gml-PO-0004-T0001.gml GE_P_HOLE_OUTSIDE in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INNER_RINGS_NESTED/","title":"R_GE_P_INNER_RINGS_NESTED","text":""},{"location":"R_GE_P_INNER_RINGS_NESTED/#requirement","title":"Requirement","text":"ID R_GE_P_INNER_RINGS_NESTED Description Interior rings must not be inside another interior ring. Error code GE_P_INNER_RINGS_NESTED <p>Example:  </p>"},{"location":"R_GE_P_INNER_RINGS_NESTED/#check","title":"Check","text":"ID C_GE_P_INNER_RINGS_NESTED Requirement ID R_GE_P_INNER_RINGS_NESTED Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Description Error code GE_P_INNER_RINGS_NESTED"},{"location":"R_GE_P_INNER_RINGS_NESTED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0005-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0005-T0002 SimpleSolid_SrefBS-GE-gml-PO-0005-T0001.gml GE_P_INNER_RINGS_NESTED in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/","title":"R_GE_P_INTERIOR_DISCONNECTED","text":""},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#requirement","title":"Requirement","text":"ID R_GE_P_INTERIOR_DISCONNECTED Description The interior of a polygon must be connected. Parameter minVertexDistance A point touches an edge if the distance is smaller than minVertexDistance, see Vertex Requirement Error code GE_P_INTERIOR_DISCONNECTED <p>Examples:  </p> <p></p>"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#check","title":"Check","text":"ID C_GE_P_INTERIOR_DISCONNECTED Requirement ID R_GE_P_INTERIOR_DISCONNECTED Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, GE_P_ORIENTATION_RINGS_SAME Description Error code GE_P_INTERIOR_DISCONNECTED"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0003-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0003-T0002 SimpleSolid_SrefBS-GE-gml-PO-0003-T0001.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0003-T0003 SimpleSolid_SrefBS-GE-gml-PO-0003-T0002.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERSECTING_RINGS/","title":"R_GE_P_INTERSECTING_RINGS","text":""},{"location":"R_GE_P_INTERSECTING_RINGS/#requirement","title":"Requirement","text":"ID R_GE_P_INTERSECTING_RINGS Description The exterior and interior rings must not intersect Parameter minVertexDistance Two rings do not intersect if only a single point of one ring touches the other. A point touches an edge only if the distance is less than minVertexDistance. Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_P_INTERSECTING_RINGS <p>Examples:</p> <p>Exterior ring intersects interior ring: </p> <p>Two interior rings intersect: </p>"},{"location":"R_GE_P_INTERSECTING_RINGS/#check","title":"Check","text":"ID C_GE_P_INTERSECTING_RINGS Requirement ID R_GE_P_INTERSECTING_RINGS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME Description If a point of an interior ring is outside the exterior ring or inside another interior ring, this is an intersection. Error code GE_P_INTERSECTING_RINGS"},{"location":"R_GE_P_INTERSECTING_RINGS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0001-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0001.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0001-T0002 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0001-T0003 SimpleSolid_SrefBS-GE-gml-PO-0001-T0003.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_NON_PLANAR/","title":"R_GE_P_NON_PLANAR","text":""},{"location":"R_GE_P_NON_PLANAR/#requirement","title":"Requirement","text":"ID R_GE_P_NON_PLANAR Description Every polygon must be planar. Planarity is achieved when no point is farther than distanceTolerance from the regression plane of all points, and the normals of every triangle of the tessellated polygon do not have an angular deviation greater than angleTolerance. Parameter 1:   type The type of the planarity check can be selected. Must be one of distance, angle, both.<ul><li>If the parameter is distance: Only the distance check is performed.</li><li> If the parameter is angle: Only the normal deviation check is performed.</li><li>If the parameter is both: Both checks are performed.</li></ul> Parameter 2:   distanceTolerance Tolerance of the distance of a point from the regression plane Parameter 3:   angleTolerance Tolerance of the angle of the triangle normals Error codes GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION <p>Normal deviation:  </p>"},{"location":"R_GE_P_NON_PLANAR/#check","title":"Check","text":"ID C_GE_P_NON_PLANAR Requirement ID R_GE_P_NON_PLANAR Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL Description To determine the normal deviation, all polygons are tessellated in order to compute the triangle normals, whose angles are used for the comparison. The tessellation of the polygons is not deterministic, and therefore the result of the normal deviation check is not deterministic. For the distance check, a regression plane is created from all polygon points in order to compute the distance of the points to this plane. Error code GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION"},{"location":"R_GE_P_NON_PLANAR/#implementation","title":"Implementation","text":"<p>In CityDoctor2 only the distance check is active by default, since the normal check does not produce deterministic results.</p>"},{"location":"R_GE_P_NON_PLANAR/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0002-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0002-T0002 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE in _Simple_BD.1_PG.2 with distanceTolerance = 0.01 GE-gml:PO-0002-T0003 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml OK for this requirement with distanceTolerance = 0.5, GE_P_ORIENTATION_RINGS_SAME in later checks GE-gml:PO-0002-T0004 SimpleSolid_SrefBS-GE-gml-PO-0002-T0002.gml GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION in _Simple_BD.1_PG.1 with parameter type = angle"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/","title":"R_GE_P_ORIENTATION_RINGS_SAME","text":""},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#requirement","title":"Requirement","text":"ID R_GE_P_ORIENTATION_RINGS_SAME Description Exterior and interior rings must not have the same orientation. Error code GE_P_ORIENTATION_RINGS_SAME <p>Example :  </p>"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#check","title":"Check","text":"ID C_GE_P_ORIENTATION_RINGS_SAME Requirement ID R_GE_P_ORIENTATION_RINGS_SAME Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR Description Error code GE_P_ORIENTATION_RINGS_SAME"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0006-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK GE-gml:PO-0006-T0002 SimpleSolid_SrefBS-GE-gml-PO-0006-T0001.gml GE_P_ORIENTATION_RINGS_SAME in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_R_COLLAPSED_TO_LINE/","title":"R_GE_R_COLLAPSED_TO_LINE","text":""},{"location":"R_GE_R_COLLAPSED_TO_LINE/#requirement","title":"Requirement","text":"ID R_GE_R_COLLAPSED_TO_LINE Description A special case of self-intersection (GE_R_SELF_INTERSECTION): The ring is a line. If the ring represents a point, then the requirements GE_R_TOO_FEW_POINTS / GE_R_CONSECUTIVE_POINTS_SAME check whether this is an error. Error code GE_R_SELF_INTERSECTION, GE_R_COLLAPSED_TO_LINE, GE_R_TOO_FEW_POINTS, GE_R_CONSECUTIVE_POINTS_SAME"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#check","title":"Check","text":"ID C_GE_R_COLLAPSED_TO_LINE Requirement ID R_GE_R_COLLAPSED_TO_LINE Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Description Ring as a point cannot happen, due to the preconditions. Error code GE_R_COLLAPSED_TO_LINE <p>The requirement is fulfilled by R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED and R_GE_R_SELF_INTERSECTION and therefore requires no separate implementation.</p>"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0005-T0001 GE-gml:LR-0005-T0001.gml GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/","title":"R_GE_R_CONSECUTIVE_POINTS_SAME","text":""},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#requirement","title":"Requirement","text":"ID R_GE_R_CONSECUTIVE_POINTS_SAME Description Points within a ring should not repeat (except the first and the last one in the case of GML, see R_GE_R_NOT_CLOSED). This error often occurs when two points are at the same location. Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_R_CONSECUTIVE_POINTS_SAME <p>For example this ring is erroneous:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>This ring is also erroneous with the parameter minVertexDistance = 0.1</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.05 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>The next example shows an erroneous ring with a point that occurs twice but where the repetition is not consecutive. This results in a self-intersection, which is not covered by this requirement.</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#check","title":"Check","text":"ID C_GE_R_CONSECUTIVE_POINTS_SAME Requirement ID R_GE_R_CONSECUTIVE_POINTS_SAME Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Description Checks whether a point repeats Error code GE_R_CONSECUTIVE_POINTS_SAME ID C_GE_R_DUPLICATE_POINT Requirement ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (partially) Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Description Detects consecutive as well as other repeating points. Error code GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0002-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0001.gml GE_R_CONSECUTIVE_POINTS_SAME in ring:_Simple_BD.1_PG.6_LR.1 GE-gml:LR-0002-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml OK for this requirement, but has error GE_R_SELF_INTERSECTION detected by C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0004 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml OK for this requirement, but has error GE_R_SELF_INTERSECTION detected by C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0005 SimpleSolid_SrefBS-GE-gml-LR-0002-T0004.gml GE_R_CONSECUTIVE_POINTS_SAME in ring:_Simple_BD.1_PG.6_LR.1 with parameter minVertexDistance = 0.1, GE_S_NOT_CLOSED error when minVertexDistance = 0.01 GE-gml:LR-0002-T0006 SimpleSolid_SrefBS-GE-gml-LR-0002-T0005.gml Not executed because GE_R_TOO_FEW_POINTS in ring:_Simple_BD.1_PG.6_LR.1"},{"location":"R_GE_R_NOT_CLOSED/","title":"R_GE_R_NOT_CLOSED","text":""},{"location":"R_GE_R_NOT_CLOSED/#requirement","title":"Requirement","text":"ID R_GE_R_NOT_CLOSED Description In GML the first and last point must be the same. Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_R_NOT_CLOSED <p>For example this ring is erroneous:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>OK with parameter minVertexDistance = 0.1:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.05&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_NOT_CLOSED/#check","title":"Check","text":"ID C_GE_R_NOT_CLOSED Requirement ID R_GE_R_NOT_CLOSED Preconditions R_SC_SCHEMA_VALIDATION Description The first and last point within a ring should be the same. Error code GE_R_NOT_CLOSED"},{"location":"R_GE_R_NOT_CLOSED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0003-T0002 SimpleSolid_SrefBS-GE-gml-LR-0003-T0001.gml GE_R_NOT_CLOSED GE-gml:LR-0003-T0003 SimpleSolid_SrefBS-GE-gml-LR-0003-T0002.gml OK with parameter minVertexDistance = 0.1"},{"location":"R_GE_R_SELF_INTERSECTION/","title":"R_GE_R_SELF_INTERSECTION","text":""},{"location":"R_GE_R_SELF_INTERSECTION/#requirement","title":"Requirement","text":"ID R_GE_R_SELF_INTERSECTION Description A ring should be simple, i.e. it should not self-intersect. The self-intersection may be at a concrete point, or not. Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement. This parameter is also used to determine when a point touches an edge. Error code GE_R_SELF_INTERSECTION <p>Examples of self-intersections:</p> <p>Bowtie: </p> <p>Point touches edge with parameter minVertexDistance: </p> <p>Duplicate points: </p> <p>Duplicate edge (same as duplicate points): </p>"},{"location":"R_GE_R_SELF_INTERSECTION/#check","title":"Check","text":"ID C_GE_R_SELF_INTERSECTION Requirement ID R_GE_R_SELF_INTERSECTION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Description Detects duplicate points and self-intersecting edges. Error codes GE_R_SELF_INTERSECTION ID C_GE_R_DUPLICATE_POINT Requirement ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (partially) Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_NOT_CLOSED Description Detects repeating and non-repeating duplicate points. The latter is a self-intersection. Error codes GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_SELF_INTERSECTION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0004-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0004-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml Duplicate points (example, not representative of the error in the model):GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml Duplicate points (results in a duplicate edge)GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0004 SimpleSolid_SrefBS-GE-gml-LR-0004-T0004.gml Bowtie (example, not representative of the error in the model): GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0005 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml Touching point with parameter minVertexDistance = 0.1: GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.2_LR.1 GE-gml:LR-0004-T0006 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml OK for this requirement with parameter minVertexDistance = 0.01, GE_S_NOT_CLOSED in later checks"},{"location":"R_GE_R_TOO_FEW_POINTS/","title":"R_GE_R_TOO_FEW_POINTS","text":""},{"location":"R_GE_R_TOO_FEW_POINTS/#requirement","title":"Requirement","text":"ID R_GE_R_TOO_FEW_POINTS Description A ring must have at least 3 points. For GML rings this requirement ignores the fact that the first and the last point are the same (see R_GE_R_NOT_CLOSED).  According to this requirement a GML ring is valid if it contains at least 3 distinct points, but it is then not closed (the requirement R_GE_R_NOT_CLOSED is not fulfilled). Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_R_TOO_FEW_POINTS <p>For example, this ring is erroneous:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Valid rings:</p> <p>(This ring is not closed, but has enough distinct points to satisfy this requirement.)</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_TOO_FEW_POINTS/#check","title":"Check","text":"ID C_GE_R_TOO_FEW_POINTS Requirement ID R_GE_R_TOO_FEW_POINTS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED Description Ring must contain at least 3 distinct points Error code GE_R_TOO_FEW_POINTS"},{"location":"R_GE_R_TOO_FEW_POINTS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0001-T0002 SimpleSolid_SrefBS-GE-gml-LR-0001-T0001.gml GE_R_TOO_FEW_POINTSin ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0001-T0003 SimpleSolid_SrefBS-GE-gml-LR-0001-T0002.gml Check not executed because GE_R_NOT_CLOSEDring _Simple_BD.1_PG.6_LR.1 is not closed, but has 3 points."},{"location":"R_GE_SO/","title":"R_GE_SO","text":""},{"location":"R_GE_SO/#requirement","title":"Requirement","text":"ID R_GE_SO Description A solid is a collection of polygons with restrictions. The geometry must be 'watertight'. See the definition of solids in Appendix A of the CityGML QIE. A solid is valid if the requirements R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION, R_GE_S_SELF_INTERSECTION are satisfied. Error code --"},{"location":"R_GE_SO/#check","title":"Check","text":"<p>no further check necessary</p>"},{"location":"R_GE_SO/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result <p>The existing test cases of the individual checks can be used.</p>"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/","title":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#requirement","title":"Requirement","text":"ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Description All polygons have the wrong orientation (defined in GE_S_POLYGON_WRONG_ORIENTATION), so that all polygons point inward. Error code GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#check","title":"Check","text":"ID C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Requirement ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_SELF_INTERSECTION, GE_S_POLYGON_WRONG_ORIENTATION Description Error code GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0008-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0008-T0002 SimpleSolid_SrefBS-GE-gml-SO-0008-T0001.gml GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/","title":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS","text":""},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#requirement","title":"Requirement","text":"ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Description 1+ polygons are not connected to the same shell. Error code GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#check","title":"Check","text":"ID C_GE_S_MULTIPLE_CONNECTED_COMPONENTS Requirement ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Build a dual graph (polygons become nodes, and polygons that share an edge are connected in the graph). If the graph is not connected, there are multiple connected components. Error code GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0005-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0005-T0002 SimpleSolid_SrefBS-GE-gml-SO-0005-T0001.gml GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/","title":"R_GE_S_NON_MANIFOLD_EDGE","text":""},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#requirement","title":"Requirement","text":"ID R_GE_S_NON_MANIFOLD_EDGE Description Every edge should bound exactly 2 polygons. Error code GE_S_NON_MANIFOLD_EDGE Comment This requirement is similar to GE_S_NOT_CLOSED: If an edge bounds more than 2 polygons, then it is a GE_S_NON_MANIFOLD_EDGE error. If an edge bounds only one polygon, it is a GE_S_NOT_CLOSED error (a hole in the solid)"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#check","title":"Check","text":"ID C_GE_S_NON_MANIFOLD_EDGE Requirement ID R_GE_S_NON_MANIFOLD_EDGE Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Error code GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0004-T0000 SimpleSolid_SrefBS.gml OK GE-gml:SO-0004-T0001 SimpleSolid_SrefBS-GE-gml-SO-0004-T0001.gml GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/","title":"R_GE_S_NON_MANIFOLD_VERTEX","text":""},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#requirement","title":"Requirement","text":"ID R_GE_S_NON_MANIFOLD_VERTEX Description Every polygon incident to a point of a solid must be connected to the other incident polygons via edges. The point and its incident polygons must form an 'umbrella'. Error code GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#check","title":"Check","text":"ID C_GE_S_NON_MANIFOLD_VERTEX Requirement ID R_GE_S_NON_MANIFOLD_VERTEX Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Error code GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0003-T0002 SimpleSolid_SrefBS-GE-gml-SO-0003-T0001.gml GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NOT_CLOSED/","title":"R_GE_S_NOT_CLOSED","text":""},{"location":"R_GE_S_NOT_CLOSED/#requirement","title":"Requirement","text":"ID R_GE_S_NOT_CLOSED Description The shell must not have any holes; it must be watertight. Error code GE_S_NOT_CLOSED"},{"location":"R_GE_S_NOT_CLOSED/#check","title":"Check","text":"ID C_GE_S_NOT_CLOSED Requirement ID R_GE_S_NOT_CLOSED Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Error code GE_S_NOT_CLOSED <p>The check collects all edges and matches them to their respective opposite edges. If an edge has no opposite edge, a hole in the shell is detected here and an error is reported.</p>"},{"location":"R_GE_S_NOT_CLOSED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0002-T0002 SimpleSolid_SrefBS-GE-gml-SO-0002-T0001.gml GE_S_NOT_CLOSED"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/","title":"R_GE_S_POLYGON_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#requirement","title":"Requirement","text":"ID R_GE_S_POLYGON_WRONG_ORIENTATION Description A polygon must be oriented so that the normal of the exterior ring points outward. The points are arranged counter-clockwise. Error code GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#check","title":"Check","text":"ID C_GE_S_POLYGON_WRONG_ORIENTATION Requirement ID R_GE_S_POLYGON_WRONG_ORIENTATION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_EDGE Description Error code GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0007-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0007-T0002 SimpleSolid_SrefBS-GE-gml-SO-0007-T0001.gml GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_SELF_INTERSECTION/","title":"R_GE_S_SELF_INTERSECTION","text":""},{"location":"R_GE_S_SELF_INTERSECTION/#requirement","title":"Requirement","text":"ID R_GE_S_SELF_INTERSECTION Description The solid must not self-intersect Error code GE_S_SELF_INTERSECTION <p>Example (left = OK, right = invalid):  </p>"},{"location":"R_GE_S_SELF_INTERSECTION/#check","title":"Check","text":"ID C_GE_S_SELF_INTERSECTION Requirement ID R_GE_S_SELF_INTERSECTION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION Description Error code GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_SELF_INTERSECTION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0006-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0006-T0002 SimpleSolid_SrefBS-GE-gml-SO-0006-T0001.gml GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_TOO_FEW_POLYGONS/","title":"R_GE_S_TOO_FEW_POLYGONS","text":""},{"location":"R_GE_S_TOO_FEW_POLYGONS/#requirement","title":"Requirement","text":"ID R_GE_S_TOO_FEW_POLYGONS Description Solids must have at least 4 polygons. Error code GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#check","title":"Check","text":"ID C_GE_S_TOO_FEW_POLYGONS Requirement ID R_GE_S_TOO_FEW_POLYGONS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL Description Error code GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0001-T0002 SimpleSolid_SrefBS-GE-gml-SO-0001-T0001.gml GE_S_TOO_FEW_POLYGONS"},{"location":"basic/","title":"Validation of 3D city models encoded in CityGML","text":""},{"location":"basic/#terms-and-definitions","title":"Terms and definitions","text":"<p>as defined in CityGML Quality Interoperability Experiment, chapter 3</p> <p>Validation</p> <p>Process of validating a CityGML data set against a specified set of requirements. A valid data set is conformant to these requirements.</p> <p>Requirements</p> <p>Rules and restrictions to define data structure and content unambiguously. Requirements can be derived from the CityGML Standard document or be defined separately as refinement of the CityGML standard to avoid ambiguities of the standard and/or specify further requirements (user/application dependent).</p> <p>Check</p> <p>Algorithmic implementation to check if a requirement is met in a validation software. </p> <p>Error</p> <p>Result of a check in case of non-conformance.</p> <p>Validation plan</p> <p>Structured list of requirements, usually depending on use case.</p>"},{"location":"basic/#additional-defintions","title":"Additional defintions","text":"<p>XSD valid</p> <p>A CityGML is conform to the schema or XSD valid if it validates against the CityGML XML schema.</p>"},{"location":"firstRun/","title":"First run","text":""},{"location":"firstRun/#start","title":"Start","text":"<p>After extracting the zip file the file structure should be similar to the example image, depending on the version (GUI or batch). </p> <p>To start CityDoctor the start.bat or start.sh should be used. It is possible to use the command in your own start scripts as needed.</p> <p>The .bat/.sh file only contains the following command (example for windows and the GUI version):</p> <pre><code>java -classpath app/*;plugins/* de.hft.stuttgart.citydoctor2.gui.CityDoctorGUIStarter\n</code></pre> <p>Note</p> <p>The exact command has changed over the development history of CityDoctor.</p> <p>For the batch version the command is similar and can be adapted for other operating systems.</p> <p>Note</p> <p>The command can also be used for Linux and Mac but the \";\" has to be replaced by \":\".</p>"},{"location":"geometric/","title":"Geometry Requirements","text":""},{"location":"geometric/#error-codes-for-geometric-errors","title":"Error codes for geometric errors","text":"<p>as defined in the CityGML Quality Interoperability Experiment, chapter 7.5.</p> <p>Note</p> <p>The requirements were renamed in CityDoctor to be more human readable. The were renamed according to the error codes.</p> <p>All the geometric errors are in the \"GE\" domain. Also, since the geometric validation is performed at 3 different levels (based on the primitives), the requirements also contain the level:</p> <ul> <li>Ring: R</li> <li>Polygon: P</li> <li>Shell: S</li> </ul> <p>Error codes follow the same system as the requirements mentioned fundamentals. A violation of each respective data quality requirement should result in an error which must be reported with an error code according to the requirement ID. For each error code, extra information can (and should) be returned. For instance: if a ring is not closed (GE_R_NOT_CLOSED) then the ID of the ring (e.g., its position (first, second..) in the polygon)  should be returned; if a polygon is not planar (GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE) then the ID of the polygon and the max. deviation from the reference plane should be returned; or if a shell is not 'watertight' (GE_S_NOT_CLOSED) then the location of the hole(s) should be returned.</p>"},{"location":"geometric/#vertex-requirement","title":"Vertex Requirement","text":"<p>Vertices A and B are the same if the euclidean distance between them is smaller than (minVertexDistance). It is also used to check whether a point is touching an edge. If a point is within minVertexDistance distance to an edge it is considered touching. This parameter is used in multiple checks with the same value:</p> <ul> <li>R_GE_R_CONSECUTIVE_POINTS_SAME</li> <li>R_GE_R_NOT_CLOSED</li> <li>R_GE_R_SELF_INTERSECTION</li> <li>R_GE_P_INTERIOR_DISCONNECTED</li> </ul> <p>The following requirements are defined for the three respective geometric levels (adopted from Ledoux (2013)):</p>"},{"location":"geometric/#linear-ring","title":"Linear Ring","text":"Requirement ID Description Error code Known checks R_GE_R_TOO_FEW_POINTS too few points GE_R_TOO_FEW_POINTS C_GE_R_TOO_FEW_POINTS R_GE_R_CONSECUTIVE_POINTS_SAME 2 consecutive points are the same GE_R_CONSECUTIVE_POINTS_SAME C_GE_R_CONSECUTIVE_POINTS_SAME, C_GE_R_DUPLICATE_POINT R_GE_R_NOT_CLOSED first-last points are not the same GE_R_NOT_CLOSED C_GE_R_NOT_CLOSED R_GE_R_SELF_INTERSECTION self-intersects, i.e., a bowtie GE_R_SELF_INTERSECTION C_GE_R_SELF_INTERSECTION, C_GE_R_DUPLICATE_POINT R_GE_R_COLLAPSED_TO_LINE Currently not in use as it is redundant with R_GE_R_SELF_INTERSECTION is point or line GE_R_COLLAPSED_TO_LINE C_GE_R_COLLAPSED_TO_LINE R_GE_R_ALL Container for: R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION -- --"},{"location":"geometric/#polygon","title":"Polygon","text":"Requirement ID Description Error code Known checks R_GE_P_INTERSECTING_RINGS 2+ rings intersect GE_P_INTERSECTING_RINGS C_GE_P_INTERSECTING_RINGS R_GE_P_NON_PLANAR Non planar polygon, both distance and normal deviation GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION C_GE_P_NON_PLANAR R_GE_P_INTERIOR_DISCONNECTED interior is not connected GE_P_INTERIOR_DISCONNECTED C_GE_P_INTERIOR_DISCONNECTED R_GE_P_HOLE_OUTSIDE 1 or more interior rings are located outside the exterior ring GE_P_HOLE_OUTSIDE C_GE_P_HOLE_OUTSIDE R_GE_P_INNER_RINGS_NESTED interior ring is located inside other GE_P_INNER_RINGS_NESTED C_GE_P_INNER_RINGS_NESTED R_GE_P_ORIENTATION_RINGS_SAME exterior and interior rings have same orientation GE_P_ORIENTATION_RINGS_SAME C_GE_P_ORIENTATION_RINGS_SAME R_GE_P_ALL Container for: R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME, R_GE_R_ALL -- --"},{"location":"geometric/#solid-shell","title":"Solid / Shell","text":"Requirement ID Description Error code Known checks R_GE_S_TOO_FEW_POLYGONS &lt;4 polygons GE_S_TOO_FEW_POLYGONS C_GE_S_TOO_FEW_POLYGONS R_GE_S_NOT_CLOSED there is 1+ hole(s) on the surface GE_S_NOT_CLOSED C_GE_S_NOT_CLOSED R_GE_S_NON_MANIFOLD_VERTEX Each shell must be simple GE_S_NON_MANIFOLD_VERTEX C_GE_S_NON_MANIFOLD_VERTEX R_GE_S_NON_MANIFOLD_EDGE Each edge of a shell should have exactly 2 incident polygons. GE_S_NON_MANIFOLD_EDGE C_GE_S_NON_MANIFOLD_EDGE R_GE_S_MULTIPLE_CONNECTED_COMPONENTS 1+ polygons not connected to main shell GE_S_MULTIPLE_CONNECTED_COMPONENTS C_GE_S_MULTIPLE_CONNECTED_COMPONENTS R_GE_S_SELF_INTERSECTION Solid self intersects GE_S_SELF_INTERSECTION C_GE_S_SELF_INTERSECTION R_GE_S_POLYGON_WRONG_ORIENTATION orientation of a polygon not correct GE_S_POLYGON_WRONG_ORIENTATION C_GE_S_POLYGON_WRONG_ORIENTATION R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION normals all pointing in wrong direction GE_S_ALL_POLYGONS_WRONG_ORIENTATION C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION R_GE_S_ALL Container for: R_GE_S_TOO_FEW_POLYGONS, R_GE_S_NOT_CLOSED, R_GE_S_NON_MANIFOLD_VERTEX, R_GE_S_NON_MANIFOLD_EDGE, R_GE_S_MULTIPLE_CONNECTED_COMPONENTS, R_GE_S_SELF_INTERSECTION, R_GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION -- --"},{"location":"geometric/#parameter-overview","title":"Parameter Overview","text":"Name Description Used in Unit minVertexDistance The minimum distance between two points before they are considered the same point R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_P_INTERIOR_DISCONNECTED Meter type Planar check type, can be distance, angle, both sein R_GE_P_NON_PLANAR - distanceTolerance Distance from the regression plane before a point is considered not in plane R_GE_P_NON_PLANAR Meter angleTolerance Difference in normal vectors before a plane is not considered planar R_GE_P_NON_PLANAR Radiant"},{"location":"geometric/#dependency-tree","title":"Dependency tree","text":"<p>This is the order the checks will be executed. If one of the depending checks is not executed or has reported an error the following check will not be executed.</p> <pre><code>graph TD;\n  X0001[R_SC_SCHEMA_VALIDATION]\n  R0001[R_GE_R_TOO_FEW_POINTS]\n  R0002[R_GE_R_CONSECUTIVE_POINTS_SAME]\n  R0003[R_GE_R_NOT_CLOSED]\n  R0004[R_GE_R_SELF_INTERSECTION]\n  P0001[R_GE_P_INTERSECTING_RINGS]\n  P0002[R_GE_P_NON_PLANAR]\n  P0003[R_GE_P_INTERIOR_DISCONNECTED]\n  P0004[R_GE_P_HOLE_OUTSIDE]\n  P0005[R_GE_P_INNER_RINGS_NESTED]\n  P0006[R_GE_P_ORIENTATION_RINGS_SAME]\n\n  S0001[R_GE_S_TOO_FEW_POLYGONS]\n  S0002[R_GE_S_NOT_CLOSED]\n  S0003[R_GE_S_NON_MANIFOLD_VERTEX]\n  S0004[R_GE_S_NON_MANIFOLD_EDGE]\n  S0005[R_GE_S_MULTIPLE_CONNECTED_COMPONENTS]\n  S0006[R_GE_S_SELF_INTERSECTION]\n  S0007[R_GE_S_POLYGON_WRONG_ORIENTATION]\n  S0008[R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION]\n\n  X0001--&gt;R0003;\n  R0003--&gt;R0001;\n  R0001--&gt;R0002;\n  R0002--&gt;R0004;\n  R0004--&gt;P0002;\n  P0002--&gt;P0006;\n  P0006--&gt;P0003;\n  P0006--&gt;P0004;\n  P0006--&gt;P0005;\n  P0004--&gt;P0001;\n  P0005--&gt;P0001;\n  P0001--&gt;S0001;\n  P0003--&gt;S0001;\n  S0001--&gt;S0002;\n  S0001--&gt;S0004;\n  S0001--&gt;S0003;\n  S0001--&gt;S0005;\n  S0002--&gt;S0007;\n  S0004--&gt;S0007;\n  S0007--&gt;S0006;\n  S0003--&gt;S0006;\n  S0005--&gt;S0006;\n  S0006--&gt;S0008; \n</code></pre>"},{"location":"geometric/#multisurface-and-solid-geometry","title":"Multisurface and Solid geometry","text":"<p>In order to simplify the definition of a validation plan, two requirement will be introduced in addition to the CityGML QIE: valid MultiSurface and valid Solid geometry. These requirements are just a collection of the linear ring, polygon and shell requirements. No extra check is required.</p> Requirement ID Description Dependencies Error code Known checks R_GE_MS valid multisurface geometry R_SC-SCHEMA-VALIDATION, R_GE_P_ALL -- -- R_GE_SO valid solid geometry R_SC-SCHEMA-VALIDATION, R_GE_S_ALL -- --"},{"location":"qual_ade/","title":"Quality-ADE","text":"<p>CityDoctor uses the Quality-ADE</p>"},{"location":"requiredSoftware/","title":"Required Software","text":""},{"location":"requiredSoftware/#versions-from-3130","title":"Versions from 3.13.0","text":"<p>Starting with version 3.13.0, a repository was created on the university's transfer portal, which will henceforth be used as a repository for finished releases:  https://transfer.hft-stuttgart.de/gitlab/citydoctor/citydoctorreleases</p> <p>The versions are divided there between CityDoctorValidation and CityDoctorGUI and under these folders there are the corresponding version folders.</p>"},{"location":"requiredSoftware/#release-versions","title":"Release Versions","text":"<p>For each CityDoctor variant (CityDoctorValidation or CityDoctorGUI) four different versions are provided for download. Java runtimes of the Liberica distribution are included in different versions. </p> Version Description CityDoctor*-no-runtime.zip This version does not include a runtime for Java. If you already have a Java version 17 installed on your PC use this. See Java CityDoctor*-win.zip Includes a Windows Java Runtime to run CityDoctor, no Java needs to be installed. CityDoctor*-lin.zip Includes a Linux Java Runtime to run CityDoctor CityDoctor*-mac.zip Includes a Mac Java Runtime to run CityDoctor"},{"location":"requiredSoftware/#versions-until-312x","title":"Versions until 3.12.x","text":"<p>CityDoctor can be downloaded from various sites. The most recent place is a gitlab repository. Alternatively, releases are also listed on the CityDoctor homepage of the BHT. There are always two versions:</p> <ul> <li>CityDoctorGUI-3.x.x.zip: This is the graphical interface including the checks. Suitable for the end user on a desktop PC.</li> <li>CityDoctorValidation-3.x.x.zip: This is the batch version suitable for integration into servers or other existing systems and has no graphical interface but works file-based as a process.</li> </ul> <p>Note</p> <p>There are sometimes special versions that have been created for testing different delivery options. Example: CityDoctorGUI-x.x.x-win.zip contains the JavaFX libraries so that a Java environment without JavaFX can also be used.</p>"},{"location":"requiredSoftware/#java","title":"Java","text":"<p>Before CityDoctor version 3.12.x Java 8 is required either as JDK or as JRE. From version 3.12.x Java 17 is required.</p> <p>Warning</p> <p>It is important that the installed Java version includes the JavaFX libraries. These are needed for the graphical user interface.</p> <p>The Liberica JRE oder JDK has proven itself for use with CityDoctor.</p> <p>Note</p> <p>The Liberica distribution is 100% free and open source.</p> <p>Note</p> <p>For the development with CityDoctor a JDK is required.</p>"},{"location":"requirements/","title":"Anforderungen und Pr\u00fcfungen f\u00fcr die Validierung von CityGML-Modellen","text":"<p>The requirements are the basic building blocks for a validation plan to validate CityGML models. For naming conventions and definitions, see fundamentals.  </p> <p>A requirement can be validated by one or more checks. A check validates one or more requirements on a model. Each check can have preconditions. If these preconditions are not met, the check is not executed. A distinction is made between:</p> <ul> <li>Schema Requirements</li> <li>Geometry Requirements</li> <li>Semantic Requirements</li> </ul>"},{"location":"schemaRequirements/","title":"Schema Requirements","text":""},{"location":"schemaRequirements/#r_sc_schema_validation","title":"R_SC_SCHEMA_VALIDATION","text":""},{"location":"schemaRequirements/#anforderung","title":"Anforderung","text":"ID R_SC_SCHEMA_VALIDATION Description A basic requirement is that each CityGML document must be well defined and XSD valid. Error code SC-SCHEMA-NOT-VALID"},{"location":"schemaRequirements/#prufung","title":"Pr\u00fcfung","text":"ID SC_SCHEMA_VALIDATION Anforderungs ID R_SC_SCHEMA_VALIDATION Requirements none Description Tools to perform XSD validation are available and give reliable results Error code SC_SCHEMA_NOT_VALID"},{"location":"semantic/","title":"Semantic Requirements","text":"<p>The semantic requirements are mostly attribute based. This results in 3 error states for an attribute:</p> <ul> <li>SE_ATTRIBUTE_WRONG_VALUE: If an attribute has a wrong value.</li> <li>SE_ATTRIBUTE_MISSING: If an attribute is missing but should be present.</li> <li>SE_ATTRIBUTE_INVALID: If an attribute is present but forbidden.</li> </ul>"},{"location":"semantic/#schematron","title":"Schematron","text":"<p>In CityDoctor wurde das XML Validierungssystem Schematron integriert um flexibel Attributpr\u00fcfungen anzupassen und zu unterst\u00fctzen. </p> <p>Hier ist ein Beispiel f\u00fcr eine Schematron Datei die CityDoctor integrieren kann:</p>"},{"location":"semantic/#citydoctor-3130","title":"CityDoctor &gt;= 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n\n</code></pre>"},{"location":"semantic/#citydoctor-3130_1","title":"CityDoctor &lt; 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n</code></pre> <p>Diese Datei pr\u00fcft, dass alle Buildings in sich selbst oder in einem ihrer Unterelementen ein Solid beliebigen LODSs vorhanden ist. Au\u00dferdem stellt die Datei sicher, dass jedes BuildingPart ein Solid enth\u00e4lt. Wenn dies nicht der Fall ist wird eine Fehlermeldung ausgegeben. Die Fehlermeldung ist dabei so formattiert, dass CityDoctor sie interpretieren und in das interne Datenmodell einbinden kann.</p>"},{"location":"semantic/#fehlerformat","title":"Fehlerformat","text":"<p>Das Fehlerformat ist ein CSV-Format mit || als Trennzeichen</p> <pre><code>parent id||child id||error code||error type||is generic attribute\n</code></pre> <p>Die Fehlermeldung besteht aus den folgenden Teilen:</p> <ul> <li>Die <code>parent id</code> ist die gml id des obersten Elements z.B. Building oder Bridge. </li> <li>Falls der Fehler in einem Unterelement aufgetreten ist so kann diese ID in dem Feld f\u00fcr die <code>child id</code> eingetragen werden.</li> <li>Im Feld <code>error type</code> ist einer der 3 Fehlertypen einzutragen: <code>SE_ATTRIBUTE_WRONG_VALUE, SE_ATTRIBUTE_MISSING, SE_ATTRIBUTE_INVALID</code>.</li> </ul> <p>note Nur in CityDoctor &lt; 3.13.0: * Um ein generisches Attribut mit dem Namen <code>measuredHeight</code> von dem nicht generischen Attribut zu unterscheiden ist im letzten Feld vorgesehen <code>true</code> einzutragen wenn es sich um ein generisches Attribut handelt ansonsten <code>false</code>. </p>"},{"location":"udt_about/","title":"UDigiT-Doctor","text":"<p>Expansion of CityDoctor2 to enable integration with urban digital twins</p> <p></p> <p>The UDigiT-Doctor project continues the development of CityDoctor2, with the goal of enabling the validation and repair of urban digital twins with CityDoctor.</p>"},{"location":"udt_about/#objectives","title":"Objectives","text":"<p>In summary, the following scientific and technical objectives can be derived to allow for a transfer of the validation functionality of CityDoctor to urban digital twins:</p> <ul> <li>Design of an internal data model and methods for the creation of an integrated complete model. </li> <li>Validation of the topological relations between objects, to assure data consistency of a generic base building model and specific use-cases (e.g. gas/water/electricity supply networks and their respective building service-connections)</li> <li>Improving repair and validation functionality by incorporating comparisons with reference data. </li> <li>Extensive, modifiable validation functionality for semantical data.</li> </ul>"},{"location":"udt_about/#license","title":"License","text":"<p>UDigiT-Doctor, being an update of CityDoctor2, will continue to be released under the LGPL as FOSS.</p>"},{"location":"udt_about/#releases","title":"Releases","text":"<p>Releases of UDigiT-Doctor will be made available via the CityDoctor2 GitLab-repository.</p>"},{"location":"udt_about/#project-information","title":"Project Information","text":"<p>Project Duration: April 01, 2024 - July 01, 2027</p> <p>Project Website: UDigiT-Doctor: Hochschule f\u00fcr Technik Stuttgart UDigiT-Doctor: Berliner Hochschule f\u00fcr Technik</p> <p>Project Lead: Prof. Dr.-Ing. Volker Coors</p> <p>Collaboration Partner: Prof. Dr. Margitta Pries</p>"},{"location":"udt_about/#partners","title":"Partners","text":"<p>Cooperation Partners: Robert Bosch GmbH Geoplex GIS GmbH M.O.S.S. Computer Grafik Systeme GmbH LandPlan OS GmbH Point Cloud Technology GmbH virtualcitysystems GmbH</p> <p>Associative Partners: Open Geospatial Consortium Stadt Stuttgart Stadt Leverkusen </p> <p>Funding: Bundesamt f\u00fcr Bildung und Forschung</p> <p>Promoter: VDI Technologiezentrum </p>"},{"location":"udt_req_data_model/","title":"Requirements of the internal data model","text":""},{"location":"udt_req_data_model/#urban-digital-twin-data","title":"Urban digital twin data","text":"<p>In order to be able to validate and repair the models of urban digital twins, CityDoctor needs the capability to access their data.</p>"},{"location":"udt_req_data_model/#reference-model","title":"Reference model","text":"<p>While CityDoctor is capable of repairing geometrical errors, the repaired model can contain discrepancies with the real object. This is expected, since CityDoctor purely operates via model data. To alleviate this, functionalities for the usage of a reference model are desired. The reference model would allow CityDoctor to determine the quality of a repair step, enabling the implementation of more sophisticated healing-routines.</p>"},{"location":"udt_req_data_model/#data-format-support","title":"Data format support","text":"<p>The aforementioned requirements revolve around data that is not compatible with, or available as, CityGML. Therefore, to </p>"},{"location":"udt_req_overview/","title":"Requirements of UDigiT-Doctor","text":"<ol> <li>Design of an internal data model and methods for the creation of an integrated complete model.</li> <li>Validation of the topological relations between objects, to assure data consistency of a generic base building model and specific use-cases (e.g. gas/water/electricity supply networks and their respective building service-connections)</li> <li>Improving repair and validation functionality by incorporating comparisons with reference data.</li> <li>Extensive, modifiable validation functionality for semantical data.</li> </ol> Specific requirements of Applicable to requirement nr. Data model 1., 2., 3. Topological consistency 2., 3. Semantical validation 2., 4."},{"location":"udt_terms/","title":"Validation of urban digital twins","text":""},{"location":"udt_terms/#terms-and-definitions","title":"Terms and definitions","text":"<p>See also: Terms and definitions of CityDoctor2</p> <p>Urban digital twin</p> <p>An urban digital twin is a virtual, representative model of a real building. Digital twins are useful for various tasks, e.g. the simulation of certain processes. They also serve as a central access point to information and data of the building, including access to installed sensors and building management systems.</p>"},{"location":"userInterface/","title":"User interface","text":""},{"location":"userInterface/#citydoctor","title":"CityDoctor","text":"<p>In the upper bar the following buttons are in order:</p> <ul> <li>Load: Opens the dialog for loading a CityGML file</li> <li>Validation: Opens the dialog to check a loaded CityGML</li> <li>Validation results: Opens the dialog for writing a test protocol in xml or pdf form</li> <li>Grid: Shows/hides the grid instead of filled polygons</li> <li>Backsides: Shows/hides backs of polygons</li> <li>Global View: Loads all elements of a CityGML into the view</li> <li>LODs: Turns individual LODs on or off from the view</li> <li>Save: Saves a CityGML file back, if the file was checked the QualityADE is written too.</li> <li>About: Opens the dialog with information about the project CityDoctor2</li> <li>View: Switches different views. There is only one for the validation part.</li> <li>Language: Here you can set the language (German/English)</li> </ul> <p>Warning</p> <p>Displaying the Global View can cause crashes with large CityGML files (&gt; 100mb depending on the system). The display may take a short time.</p>"},{"location":"userInterface/#load","title":"Load","text":"<p>The Load button opens the dialog for loading a CityGML file.</p> <p></p> <p>In the file bar a file path can be entered or selected via the Select button.</p> <p>In addition, other settings for reading the file can be specified.</p> <ul> <li>NumberOfRoundingPlaces: To how many decimal places are the read-in values rounded?</li> <li>XML-Validierung: Performs an XML validation. Errors are detected directly during the import and the import is aborted.</li> <li>Low Memory Consumption Mode : Saves RAM to allow larger files in the GUI. Slight performance costs during the validation process.</li> </ul> <p>When loading, the progress is approximately represented by the loading bar.</p> <p>Note</p> <p>Files can also be dragged and dropped directly from the file manager into the GUI without using the load dialog. The default values are assumed (8 decimal places, no XML validation).</p> <p>After loading a CityGML file, the elements are displayed in the individual tabs. Selecting an element will display it in the view.</p> <p></p> <p>Note</p> <p>By selecting the top element of a tab, all elements within this tab are displayed. As the above warning states, larger amounts of data will cause crashes.</p>"},{"location":"userInterface/#validation","title":"Validation","text":"<p>The validation plan can be customized in the check dialog. In addition to the available checks, the global parameters are also displayed here.</p> <p>The parameters can be changed with a double click in the value column. The unit is fixed.</p> <p>Note</p> <p>The numberOfRoundingPlaces parameter cannot be changed. It was set when the file was loaded.</p> <p>If checks should not be executed, they can be deactivated in the Active column.</p> <p>Warning</p> <p>If checks are disabled but other active checks need them as dependencies, they will be re-enabled during the check to ensure stability. See Requirements.</p> <p>In the Schematron file field, a path to a Schematron file can be entered. In this file flexible rules for the semantic requirements can be defined. See Semantic Requirements</p> <p>The test plan can be saved and loaded via the two buttons at the top right.</p> <p>After the check, elements with errors are colored red and elements without errors are colored green. When selecting an element that contains errors, the errors are displayed in the lower tab Errors. There you can select the error to display it in CityDoctor and get more information.</p> <p></p> <p>The elements can be filtered with the dropdown menu to show only faulty elements.</p>"},{"location":"userInterface/#validation-reports","title":"Validation reports","text":"<p>In this dialog there is again an overview of the errors in image form and the possibility to write an xml or pdf report.</p> <p></p>"},{"location":"validationPlan/","title":"Validation Plan","text":"<p>the validation plan for CityDoctor is specified in YAML.</p> <p>For version 3.12.x and later, an example looks like this:</p> <pre><code>globalParameters:\n   numberOfRoundingPlaces: 8\n   # in m\n   minVertexDistance: 0.0001\n   schematronPath: 'checkForSolid.xml'\nuseStreaming: true # (1)!\nrequirements:\n   R_GE_R_TOO_FEW_POINTS:\n      enabled: true\n   R_GE_R_NOT_CLOSED:\n      enabled: true\n   R_GE_R_CONSECUTIVE_POINTS_SAME:\n      enabled: true\n   R_GE_R_SELF_INTERSECTION:\n      enabled: true\n   R_GE_S_MULTIPLE_CONNECTED_COMPONENTS:\n      enabled: true\n   R_GE_P_INTERIOR_DISCONNECTED:\n      enabled: true\n   R_GE_P_INTERSECTING_RINGS:\n      enabled: true\n   R_GE_P_NON_PLANAR:\n      enabled: true\n      parameters:\n         # one of (\"distance\", \"angle\", \"both\")\n         type: distance\n         # in m\n         distanceTolerance: 0.01\n         # in degree\n         angleTolerance: 1\n   R_GE_P_HOLE_OUTSIDE:\n      enabled: true\n   R_GE_P_ORIENTATION_RINGS_SAME:\n      enabled: true\n   R_GE_P_INNER_RINGS_NESTED:\n      enabled: true\n   R_GE_S_TOO_FEW_POLYGONS:\n      enabled: true\n   R_GE_S_NOT_CLOSED:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_EDGE:\n      enabled: true\n   R_GE_S_POLYGON_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_VERTEX:\n      enabled: true\n   R_GE_S_SELF_INTERSECTION:\n      enabled: true\n   R_SE_BS_IS_WALL:\n      enabled: false\n      parameters:\n            lowerAngle: '45'\n            upperAngle: '135'\n   R_SE_BS_IS_FLOOR:\n      enabled: false\n   R_SE_BS_GROUND_UNFRAGMENTED:\n      enabled: false\n   R_SE_BS_IS_GROUND:\n      enabled: false\n   R_SE_BS_IS_CEILING:\n      enabled: false\n</code></pre> <ol> <li>The parameter <code>useStreaming</code> is a switch to read a file piece by piece instead of reading the complete file before the check takes place. With this setting also files &gt; 2GB can be checked without large RAM requirements.</li> </ol> <p>In the validation plan you will find the same settings that are listed in the graphical user interface.</p> <p>All requirements that are to be checked are listed under requirements. The semantic checks are deactivated by default. </p>"},{"location":"zipFiles/","title":"Zip Archives","text":"<p>CityDoctor is capable of parsing zip archives to enable the validation of contained CityGML files.</p>"},{"location":"zipFiles/#loading-a-zip-archive","title":"Loading a zip archive","text":"<p>To load a zip archive, select a zip file using file loading dialoge. CityDoctor will analyze the zip file for potential CityGml files.</p>"},{"location":"zipFiles/#zip-entry-manager","title":"Zip entry manager","text":"<p>CityDoctor will show the zip entry manager after successfully loading a zip archive. The zip entry manager has the following buttons:  </p> <ol> <li>Show model: Shows the city model of the selected entry in the main window of CityDoctor, giving access to the normal CityDoctor functionality. Only available for decompressed entries.</li> <li>Decompress entry: Decompresses the selected entry.</li> <li>Error statistics: Shows the error statistics of the selected entry. Only available for validated entries.</li> <li>Decompress all entries: Decompresses all entries of the archive.</li> <li>Check all: Opens the checking dialoge, allowing batch validation of all entries. See validation for more details.</li> <li>Save reports: Allows saving of validation reports. Available after at least one entry has been validated.</li> </ol> <p></p> <p>Entries display their current state via color coding. Possible states are:</p> <ul> <li>compressed(black): A compressed entry is still 'zipped'.</li> <li>decompressed(blue): A decompressed entry has been successfully 'unzipped' into the memory.</li> <li>empty model(gray): A decompressed entry containing no city model or a model without any city objects.</li> <li>erroneous entry(dark red): An entry which could not be successfully decompressed, due to either having an invalid CityGML file, being too big to be held in memory or encountering a problem while reading the file. The respective reason will be shown in the entry's metadata.</li> <li>validated with / without errors (bright red / green respectively)</li> </ul> <p>Note</p> <p>The original zip file or its entries will not be changed. Decompressed data is a copy of the source entry.</p>"},{"location":"zipFiles/#validation","title":"Validation","text":""},{"location":"zipFiles/#validation-of-individual-entries","title":"Validation of individual entries","text":"<p>Decompressed entries can be validated individually through the CityDoctor main window. CityDoctor will retain the validation results for each entry in memory until the application is closed or a new zip archive is loaded.</p>"},{"location":"zipFiles/#batch-validation","title":"Batch validation","text":"<p>The \"Check all\" button in the zip entry manager opens the option window for the batch validation. This process does not require prior decompression of the entries and offers two modes of operation:</p>"},{"location":"zipFiles/#default-mode","title":"Default mode","text":"<p>The default batch validation mode validates each entry within the archive. Compressed entries will be automatically decompressed during this process. Like with the individual validation, the results are held in memory and can be inspected in CityDoctor.</p>"},{"location":"zipFiles/#low-memory-mode-stream-mode","title":"Low memory mode (stream mode)","text":"<p>Low memory mode utilizes datastreams to read and check the city model features individually. This significantly decreases memory overhead and usage by eliminating the need for entry decompression. However, this also means that the state of entries remains unchanged. As a result, the results of the validation cannot be inspected within CityDoctor and will be recorded in report files at the designated output location.</p>"}]}
\ No newline at end of file
+{"config":{"lang":["en"],"separator":"[\\s\\-]+","pipeline":["stopWordFilter"]},"docs":[{"location":"","title":"CityDoctor2","text":"<p>Development of a automatic repair system for virtual city models </p> <p>CityDoctor2 is a quality check software for 3D city models in CityGML format. CityDoctor can read CityGML 1/2 documents and since version 3.12 can also read CityGML 3 with restrictions. All check results can be output in xml or pdf form. Additionally CityDoctor implements the QualityADE to save test results directly into CityGML.</p> <p></p>"},{"location":"#licence-versions","title":"Licence / Versions","text":""},{"location":"#citydoctorvalidation","title":"CityDoctorValidation","text":"<p>The validation part of CityDoctor is freely available and open source</p>"},{"location":"#citydoctorgui","title":"CityDoctorGUI","text":"<p>The graphical interface is freely available and open source</p>"},{"location":"#citydoctorhealer","title":"CityDoctorHealer","text":"<p>The part responsible for the repair is freely available and open source. Mail to:  </p>"},{"location":"#projekts","title":"Projekts","text":"<p>CityDoctor was developed in several projects. At the moment CityDoctor is developed in the project UDigitDoctor.</p> <p>Past project:</p> <ul> <li>CityDoctor2</li> </ul>"},{"location":"R_GE_MS/","title":"R_GE_MS","text":""},{"location":"R_GE_MS/#requirement","title":"Requirement","text":"ID R_GE_MS Description A MultiSurface is a collection of polygons without further restrictions. A MultiSurface is only valid if all polygons are valid. The requirements R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_R_TOO_FEW_POINTS, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME must be satisfied Error code --"},{"location":"R_GE_MS/#check","title":"Check","text":"<p>No further checks necessary. The individual requirements have their own checks to verify them.</p>"},{"location":"R_GE_MS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result <p>Existing test cases can be used. </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/","title":"R_GE_P_HOLE_OUTSIDE","text":""},{"location":"R_GE_P_HOLE_OUTSIDE/#requirement","title":"Requirement","text":"ID R_GE_P_HOLE_OUTSIDE Description An interior ring must not be completely outside the exterior ring. Error code GE_P_HOLE_OUTSIDE <p>Example:  </p>"},{"location":"R_GE_P_HOLE_OUTSIDE/#check","title":"Check","text":"ID C_GE_P_HOLE_OUTSIDE Requirement ID R_GE_P_HOLE_OUTSIDE Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Description Error code GE_P_HOLE_OUTSIDE"},{"location":"R_GE_P_HOLE_OUTSIDE/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0004-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0004-T0002 SimpleSolid_SrefBS-GE-gml-PO-0004-T0001.gml GE_P_HOLE_OUTSIDE in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INNER_RINGS_NESTED/","title":"R_GE_P_INNER_RINGS_NESTED","text":""},{"location":"R_GE_P_INNER_RINGS_NESTED/#requirement","title":"Requirement","text":"ID R_GE_P_INNER_RINGS_NESTED Description Interior rings must not be inside another interior ring. Error code GE_P_INNER_RINGS_NESTED <p>Example:  </p>"},{"location":"R_GE_P_INNER_RINGS_NESTED/#check","title":"Check","text":"ID C_GE_P_INNER_RINGS_NESTED Requirement ID R_GE_P_INNER_RINGS_NESTED Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_ORIENTATION_RINGS_SAME Description Error code GE_P_INNER_RINGS_NESTED"},{"location":"R_GE_P_INNER_RINGS_NESTED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0005-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0005-T0002 SimpleSolid_SrefBS-GE-gml-PO-0005-T0001.gml GE_P_INNER_RINGS_NESTED in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/","title":"R_GE_P_INTERIOR_DISCONNECTED","text":""},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#requirement","title":"Requirement","text":"ID R_GE_P_INTERIOR_DISCONNECTED Description The interior of a polygon must be connected. Parameter minVertexDistance A point touches an edge if the distance is smaller than minVertexDistance, see Vertex Requirement Error code GE_P_INTERIOR_DISCONNECTED <p>Examples:  </p> <p></p>"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#check","title":"Check","text":"ID C_GE_P_INTERIOR_DISCONNECTED Requirement ID R_GE_P_INTERIOR_DISCONNECTED Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, GE_P_ORIENTATION_RINGS_SAME Description Error code GE_P_INTERIOR_DISCONNECTED"},{"location":"R_GE_P_INTERIOR_DISCONNECTED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0003-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0003-T0002 SimpleSolid_SrefBS-GE-gml-PO-0003-T0001.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0003-T0003 SimpleSolid_SrefBS-GE-gml-PO-0003-T0002.gml GE_P_INTERIOR_DISCONNECTED in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_INTERSECTING_RINGS/","title":"R_GE_P_INTERSECTING_RINGS","text":""},{"location":"R_GE_P_INTERSECTING_RINGS/#requirement","title":"Requirement","text":"ID R_GE_P_INTERSECTING_RINGS Description The exterior and interior rings must not intersect Parameter minVertexDistance Two rings do not intersect if only a single point of one ring touches the other. A point touches an edge only if the distance is less than minVertexDistance. Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_P_INTERSECTING_RINGS <p>Examples:</p> <p>Exterior ring intersects interior ring: </p> <p>Two interior rings intersect: </p>"},{"location":"R_GE_P_INTERSECTING_RINGS/#check","title":"Check","text":"ID C_GE_P_INTERSECTING_RINGS Requirement ID R_GE_P_INTERSECTING_RINGS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME Description If a point of an interior ring is outside the exterior ring or inside another interior ring, this is an intersection. Error code GE_P_INTERSECTING_RINGS"},{"location":"R_GE_P_INTERSECTING_RINGS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0001-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0001.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2 GE-gml:PO-0001-T0002 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0001-T0003 SimpleSolid_SrefBS-GE-gml-PO-0001-T0003.gml GE_P_INTERSECTING_RINGS in Polygon _Simple_BD.1_PG.2"},{"location":"R_GE_P_NON_PLANAR/","title":"R_GE_P_NON_PLANAR","text":""},{"location":"R_GE_P_NON_PLANAR/#requirement","title":"Requirement","text":"ID R_GE_P_NON_PLANAR Description Every polygon must be planar. Planarity is achieved when no point is farther than distanceTolerance from the regression plane of all points, and the normals of every triangle of the tessellated polygon do not have an angular deviation greater than angleTolerance. Parameter 1:   type The type of the planarity check can be selected. Must be one of distance, angle, both.<ul><li>If the parameter is distance: Only the distance check is performed.</li><li> If the parameter is angle: Only the normal deviation check is performed.</li><li>If the parameter is both: Both checks are performed.</li></ul> Parameter 2:   distanceTolerance Tolerance of the distance of a point from the regression plane Parameter 3:   angleTolerance Tolerance of the angle of the triangle normals Error codes GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION <p>Normal deviation:  </p> <p>Distance of a point to the regression plane:  </p>"},{"location":"R_GE_P_NON_PLANAR/#check","title":"Check","text":"ID C_GE_P_NON_PLANAR Requirement ID R_GE_P_NON_PLANAR Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL Description To determine the normal deviation, all polygons are tessellated in order to compute the triangle normals, whose angles are used for the comparison. The tessellation of the polygons is not deterministic, and therefore the result of the normal deviation check is not deterministic. For the distance check, a regression plane is created from all polygon points in order to compute the distance of the points to this plane. Error code GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION"},{"location":"R_GE_P_NON_PLANAR/#implementation","title":"Implementation","text":"<p>In CityDoctor2 only the distance check is active by default, since the normal check does not produce deterministic results.</p>"},{"location":"R_GE_P_NON_PLANAR/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0002-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK for this requirement, GE_S_NOT_CLOSED error in later checks GE-gml:PO-0002-T0002 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE in _Simple_BD.1_PG.2 with distanceTolerance = 0.01 GE-gml:PO-0002-T0003 SimpleSolid_SrefBS-GE-gml-PO-0002-T0001.gml OK for this requirement with distanceTolerance = 0.5, GE_P_ORIENTATION_RINGS_SAME in later checks GE-gml:PO-0002-T0004 SimpleSolid_SrefBS-GE-gml-PO-0002-T0002.gml GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION in _Simple_BD.1_PG.1 with parameter type = angle"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/","title":"R_GE_P_ORIENTATION_RINGS_SAME","text":""},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#requirement","title":"Requirement","text":"ID R_GE_P_ORIENTATION_RINGS_SAME Description Exterior and interior rings must not have the same orientation. Error code GE_P_ORIENTATION_RINGS_SAME <p>Example :  </p>"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#check","title":"Check","text":"ID C_GE_P_ORIENTATION_RINGS_SAME Requirement ID R_GE_P_ORIENTATION_RINGS_SAME Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_NON_PLANAR Description Error code GE_P_ORIENTATION_RINGS_SAME"},{"location":"R_GE_P_ORIENTATION_RINGS_SAME/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:PO-0006-T0001 SimpleSolid_SrefBS-GE-gml-PO-0001-T0002.gml OK GE-gml:PO-0006-T0002 SimpleSolid_SrefBS-GE-gml-PO-0006-T0001.gml GE_P_ORIENTATION_RINGS_SAME in Polygon: _Simple_BD.1_PG.2"},{"location":"R_GE_R_COLLAPSED_TO_LINE/","title":"R_GE_R_COLLAPSED_TO_LINE","text":""},{"location":"R_GE_R_COLLAPSED_TO_LINE/#requirement","title":"Requirement","text":"ID R_GE_R_COLLAPSED_TO_LINE Description A special case of self-intersection (GE_R_SELF_INTERSECTION): The ring is a line. If the ring represents a point, then the requirements GE_R_TOO_FEW_POINTS / GE_R_CONSECUTIVE_POINTS_SAME check whether this is an error. Error code GE_R_SELF_INTERSECTION, GE_R_COLLAPSED_TO_LINE, GE_R_TOO_FEW_POINTS, GE_R_CONSECUTIVE_POINTS_SAME"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#check","title":"Check","text":"ID C_GE_R_COLLAPSED_TO_LINE Requirement ID R_GE_R_COLLAPSED_TO_LINE Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Description Ring as a point cannot happen, due to the preconditions. Error code GE_R_COLLAPSED_TO_LINE <p>The requirement is fulfilled by R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED and R_GE_R_SELF_INTERSECTION and therefore requires no separate implementation.</p>"},{"location":"R_GE_R_COLLAPSED_TO_LINE/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0005-T0001 GE-gml:LR-0005-T0001.gml GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/","title":"R_GE_R_CONSECUTIVE_POINTS_SAME","text":""},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#requirement","title":"Requirement","text":"ID R_GE_R_CONSECUTIVE_POINTS_SAME Description Points within a ring should not repeat (except the first and the last one in the case of GML, see R_GE_R_NOT_CLOSED). This error often occurs when two points are at the same location. Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_R_CONSECUTIVE_POINTS_SAME <p>For example this ring is erroneous:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>This ring is also erroneous with the parameter minVertexDistance = 0.1</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.05 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;      \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>The next example shows an erroneous ring with a point that occurs twice but where the repetition is not consecutive. This results in a self-intersection, which is not covered by this requirement.</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#check","title":"Check","text":"ID C_GE_R_CONSECUTIVE_POINTS_SAME Requirement ID R_GE_R_CONSECUTIVE_POINTS_SAME Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Description Checks whether a point repeats Error code GE_R_CONSECUTIVE_POINTS_SAME ID C_GE_R_DUPLICATE_POINT Requirement ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (partially) Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED, R_GE_R_TOO_FEW_POINTS Description Detects consecutive as well as other repeating points. Error code GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_CONSECUTIVE_POINTS_SAME/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0002-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0001.gml GE_R_CONSECUTIVE_POINTS_SAME in ring:_Simple_BD.1_PG.6_LR.1 GE-gml:LR-0002-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml OK for this requirement, but has error GE_R_SELF_INTERSECTION detected by C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0004 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml OK for this requirement, but has error GE_R_SELF_INTERSECTION detected by C_GE_R_DUPLICATE_POINT GE-gml:LR-0002-T0005 SimpleSolid_SrefBS-GE-gml-LR-0002-T0004.gml GE_R_CONSECUTIVE_POINTS_SAME in ring:_Simple_BD.1_PG.6_LR.1 with parameter minVertexDistance = 0.1, GE_S_NOT_CLOSED error when minVertexDistance = 0.01 GE-gml:LR-0002-T0006 SimpleSolid_SrefBS-GE-gml-LR-0002-T0005.gml Not executed because GE_R_TOO_FEW_POINTS in ring:_Simple_BD.1_PG.6_LR.1"},{"location":"R_GE_R_NOT_CLOSED/","title":"R_GE_R_NOT_CLOSED","text":""},{"location":"R_GE_R_NOT_CLOSED/#requirement","title":"Requirement","text":"ID R_GE_R_NOT_CLOSED Description In GML the first and last point must be the same. Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_R_NOT_CLOSED <p>For example this ring is erroneous:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>OK with parameter minVertexDistance = 0.1:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;1.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.05&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_NOT_CLOSED/#check","title":"Check","text":"ID C_GE_R_NOT_CLOSED Requirement ID R_GE_R_NOT_CLOSED Preconditions R_SC_SCHEMA_VALIDATION Description The first and last point within a ring should be the same. Error code GE_R_NOT_CLOSED"},{"location":"R_GE_R_NOT_CLOSED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0003-T0002 SimpleSolid_SrefBS-GE-gml-LR-0003-T0001.gml GE_R_NOT_CLOSED GE-gml:LR-0003-T0003 SimpleSolid_SrefBS-GE-gml-LR-0003-T0002.gml OK with parameter minVertexDistance = 0.1"},{"location":"R_GE_R_SELF_INTERSECTION/","title":"R_GE_R_SELF_INTERSECTION","text":""},{"location":"R_GE_R_SELF_INTERSECTION/#requirement","title":"Requirement","text":"ID R_GE_R_SELF_INTERSECTION Description A ring should be simple, i.e. it should not self-intersect. The self-intersection may be at a concrete point, or not. Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement. This parameter is also used to determine when a point touches an edge. Error code GE_R_SELF_INTERSECTION <p>Examples of self-intersections:</p> <p>Bowtie: </p> <p>Point touches edge with parameter minVertexDistance: </p> <p>Duplicate points: </p> <p>Duplicate edge (same as duplicate points): </p>"},{"location":"R_GE_R_SELF_INTERSECTION/#check","title":"Check","text":"ID C_GE_R_SELF_INTERSECTION Requirement ID R_GE_R_SELF_INTERSECTION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED Description Detects duplicate points and self-intersecting edges. Error codes GE_R_SELF_INTERSECTION ID C_GE_R_DUPLICATE_POINT Requirement ID R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_SELF_INTERSECTION (partially) Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_TOO_FEW_POINTS, R_GE_R_NOT_CLOSED Description Detects repeating and non-repeating duplicate points. The latter is a self-intersection. Error codes GE_R_CONSECUTIVE_POINTS_SAME, GE_R_SELF_INTERSECTION"},{"location":"R_GE_R_SELF_INTERSECTION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0004-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0004-T0002 SimpleSolid_SrefBS-GE-gml-LR-0002-T0002.gml Duplicate points (example, not representative of the error in the model):GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0003 SimpleSolid_SrefBS-GE-gml-LR-0002-T0003.gml Duplicate points (results in a duplicate edge)GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0004 SimpleSolid_SrefBS-GE-gml-LR-0004-T0004.gml Bowtie (example, not representative of the error in the model): GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0004-T0005 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml Touching point with parameter minVertexDistance = 0.1: GE_R_SELF_INTERSECTION in ring: _Simple_BD.1_PG.2_LR.1 GE-gml:LR-0004-T0006 SimpleSolid_SrefBS-GE-gml-LR-0004-T0005.gml OK for this requirement with parameter minVertexDistance = 0.01, GE_S_NOT_CLOSED in later checks"},{"location":"R_GE_R_TOO_FEW_POINTS/","title":"R_GE_R_TOO_FEW_POINTS","text":""},{"location":"R_GE_R_TOO_FEW_POINTS/#requirement","title":"Requirement","text":"ID R_GE_R_TOO_FEW_POINTS Description A ring must have at least 3 points. For GML rings this requirement ignores the fact that the first and the last point are the same (see R_GE_R_NOT_CLOSED).  According to this requirement a GML ring is valid if it contains at least 3 distinct points, but it is then not closed (the requirement R_GE_R_NOT_CLOSED is not fulfilled). Parameter minVertexDistance Points can be considered the same despite (small) distances, see Vertex Requirement Error code GE_R_TOO_FEW_POINTS <p>For example, this ring is erroneous:</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <p>Valid rings:</p> <p>(This ring is not closed, but has enough distinct points to satisfy this requirement.)</p> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre> <pre><code>&lt;gml:LinearRing&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;1.0 0.0 0.0&lt;/gml:pos&gt;  \n&lt;gml:pos&gt;0.0 1.0 0.0&lt;/gml:pos&gt;\n&lt;gml:pos&gt;0.0 0.0 0.0&lt;/gml:pos&gt;\n&lt;/gml:LinearRing&gt;\n</code></pre>"},{"location":"R_GE_R_TOO_FEW_POINTS/#check","title":"Check","text":"ID C_GE_R_TOO_FEW_POINTS Requirement ID R_GE_R_TOO_FEW_POINTS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_NOT_CLOSED Description Ring must contain at least 3 distinct points Error code GE_R_TOO_FEW_POINTS"},{"location":"R_GE_R_TOO_FEW_POINTS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:LR-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:LR-0001-T0002 SimpleSolid_SrefBS-GE-gml-LR-0001-T0001.gml GE_R_TOO_FEW_POINTSin ring: _Simple_BD.1_PG.6_LR.1 GE-gml:LR-0001-T0003 SimpleSolid_SrefBS-GE-gml-LR-0001-T0002.gml Check not executed because GE_R_NOT_CLOSEDring _Simple_BD.1_PG.6_LR.1 is not closed, but has 3 points."},{"location":"R_GE_SO/","title":"R_GE_SO","text":""},{"location":"R_GE_SO/#requirement","title":"Requirement","text":"ID R_GE_SO Description A solid is a collection of polygons with restrictions. The geometry must be 'watertight'. See the definition of solids in Appendix A of the CityGML QIE. A solid is valid if the requirements R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION, R_GE_S_SELF_INTERSECTION are satisfied. Error code --"},{"location":"R_GE_SO/#check","title":"Check","text":"<p>no further check necessary</p>"},{"location":"R_GE_SO/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result <p>The existing test cases of the individual checks can be used.</p>"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/","title":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#requirement","title":"Requirement","text":"ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Description All polygons have the wrong orientation (defined in GE_S_POLYGON_WRONG_ORIENTATION), so that all polygons point inward. Error code GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#check","title":"Check","text":"ID C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Requirement ID R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_SELF_INTERSECTION, GE_S_POLYGON_WRONG_ORIENTATION Description Error code GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0008-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0008-T0002 SimpleSolid_SrefBS-GE-gml-SO-0008-T0001.gml GE_S_ALL_POLYGONS_WRONG_ORIENTATION"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/","title":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS","text":""},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#requirement","title":"Requirement","text":"ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Description 1+ polygons are not connected to the same shell. Error code GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#check","title":"Check","text":"ID C_GE_S_MULTIPLE_CONNECTED_COMPONENTS Requirement ID R_GE_S_MULTIPLE_CONNECTED_COMPONENTS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Build a dual graph (polygons become nodes, and polygons that share an edge are connected in the graph). If the graph is not connected, there are multiple connected components. Error code GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_MULTIPLE_CONNECTED_COMPONENTS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0005-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0005-T0002 SimpleSolid_SrefBS-GE-gml-SO-0005-T0001.gml GE_S_MULTIPLE_CONNECTED_COMPONENTS"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/","title":"R_GE_S_NON_MANIFOLD_EDGE","text":""},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#requirement","title":"Requirement","text":"ID R_GE_S_NON_MANIFOLD_EDGE Description Every edge should bound exactly 2 polygons. Error code GE_S_NON_MANIFOLD_EDGE Comment This requirement is similar to GE_S_NOT_CLOSED: If an edge bounds more than 2 polygons, then it is a GE_S_NON_MANIFOLD_EDGE error. If an edge bounds only one polygon, it is a GE_S_NOT_CLOSED error (a hole in the solid)"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#check","title":"Check","text":"ID C_GE_S_NON_MANIFOLD_EDGE Requirement ID R_GE_S_NON_MANIFOLD_EDGE Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Error code GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_EDGE/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0004-T0000 SimpleSolid_SrefBS.gml OK GE-gml:SO-0004-T0001 SimpleSolid_SrefBS-GE-gml-SO-0004-T0001.gml GE_S_NON_MANIFOLD_EDGE"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/","title":"R_GE_S_NON_MANIFOLD_VERTEX","text":""},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#requirement","title":"Requirement","text":"ID R_GE_S_NON_MANIFOLD_VERTEX Description Every polygon incident to a point of a solid must be connected to the other incident polygons via edges. The point and its incident polygons must form an 'umbrella'. Error code GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#check","title":"Check","text":"ID C_GE_S_NON_MANIFOLD_VERTEX Requirement ID R_GE_S_NON_MANIFOLD_VERTEX Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Error code GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NON_MANIFOLD_VERTEX/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0003-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0003-T0002 SimpleSolid_SrefBS-GE-gml-SO-0003-T0001.gml GE_S_NON_MANIFOLD_VERTEX"},{"location":"R_GE_S_NOT_CLOSED/","title":"R_GE_S_NOT_CLOSED","text":""},{"location":"R_GE_S_NOT_CLOSED/#requirement","title":"Requirement","text":"ID R_GE_S_NOT_CLOSED Description The shell must not have any holes; it must be watertight. Error code GE_S_NOT_CLOSED"},{"location":"R_GE_S_NOT_CLOSED/#check","title":"Check","text":"ID C_GE_S_NOT_CLOSED Requirement ID R_GE_S_NOT_CLOSED Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS Description Error code GE_S_NOT_CLOSED <p>The check collects all edges and matches them to their respective opposite edges. If an edge has no opposite edge, a hole in the shell is detected here and an error is reported.</p>"},{"location":"R_GE_S_NOT_CLOSED/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0002-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0002-T0002 SimpleSolid_SrefBS-GE-gml-SO-0002-T0001.gml GE_S_NOT_CLOSED"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/","title":"R_GE_S_POLYGON_WRONG_ORIENTATION","text":""},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#requirement","title":"Requirement","text":"ID R_GE_S_POLYGON_WRONG_ORIENTATION Description A polygon must be oriented so that the normal of the exterior ring points outward. The points are arranged counter-clockwise. Error code GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#check","title":"Check","text":"ID C_GE_S_POLYGON_WRONG_ORIENTATION Requirement ID R_GE_S_POLYGON_WRONG_ORIENTATION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_EDGE Description Error code GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_POLYGON_WRONG_ORIENTATION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0007-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0007-T0002 SimpleSolid_SrefBS-GE-gml-SO-0007-T0001.gml GE_S_POLYGON_WRONG_ORIENTATION"},{"location":"R_GE_S_SELF_INTERSECTION/","title":"R_GE_S_SELF_INTERSECTION","text":""},{"location":"R_GE_S_SELF_INTERSECTION/#requirement","title":"Requirement","text":"ID R_GE_S_SELF_INTERSECTION Description The solid must not self-intersect Error code GE_S_SELF_INTERSECTION <p>Example (left = OK, right = invalid):  </p>"},{"location":"R_GE_S_SELF_INTERSECTION/#check","title":"Check","text":"ID C_GE_S_SELF_INTERSECTION Requirement ID R_GE_S_SELF_INTERSECTION Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL, GE_S_TOO_FEW_POLYGONS, GE_S_NOT_CLOSED, GE_S_NON_MANIFOLD_VERTEX, GE_S_NON_MANIFOLD_EDGE, GE_S_MULTIPLE_CONNECTED_COMPONENTS, GE_S_POLYGON_WRONG_ORIENTATION Description Error code GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_SELF_INTERSECTION/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0006-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0006-T0002 SimpleSolid_SrefBS-GE-gml-SO-0006-T0001.gml GE_S_SELF_INTERSECTION"},{"location":"R_GE_S_TOO_FEW_POLYGONS/","title":"R_GE_S_TOO_FEW_POLYGONS","text":""},{"location":"R_GE_S_TOO_FEW_POLYGONS/#requirement","title":"Requirement","text":"ID R_GE_S_TOO_FEW_POLYGONS Description Solids must have at least 4 polygons. Error code GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#check","title":"Check","text":"ID C_GE_S_TOO_FEW_POLYGONS Requirement ID R_GE_S_TOO_FEW_POLYGONS Preconditions R_SC_SCHEMA_VALIDATION, R_GE_R_ALL, R_GE_P_ALL Description Error code GE_S_TOO_FEW_POLYGONS"},{"location":"R_GE_S_TOO_FEW_POLYGONS/#test-cases","title":"Test cases","text":"Test case ID CityGML model Expected result GE-gml:SO-0001-T0001 SimpleSolid_SrefBS.gml OK GE-gml:SO-0001-T0002 SimpleSolid_SrefBS-GE-gml-SO-0001-T0001.gml GE_S_TOO_FEW_POLYGONS"},{"location":"basic/","title":"Validation of 3D city models encoded in CityGML","text":""},{"location":"basic/#terms-and-definitions","title":"Terms and definitions","text":"<p>as defined in CityGML Quality Interoperability Experiment, chapter 3</p> <p>Validation</p> <p>Process of validating a CityGML data set against a specified set of requirements. A valid data set is conformant to these requirements.</p> <p>Requirements</p> <p>Rules and restrictions to define data structure and content unambiguously. Requirements can be derived from the CityGML Standard document or be defined separately as refinement of the CityGML standard to avoid ambiguities of the standard and/or specify further requirements (user/application dependent).</p> <p>Check</p> <p>Algorithmic implementation to check if a requirement is met in a validation software. </p> <p>Error</p> <p>Result of a check in case of non-conformance.</p> <p>Validation plan</p> <p>Structured list of requirements, usually depending on use case.</p>"},{"location":"basic/#additional-defintions","title":"Additional defintions","text":"<p>XSD valid</p> <p>A CityGML is conform to the schema or XSD valid if it validates against the CityGML XML schema.</p>"},{"location":"firstRun/","title":"First run","text":""},{"location":"firstRun/#start","title":"Start","text":"<p>After extracting the zip file the file structure should be similar to the example image, depending on the version (GUI or batch). </p> <p>To start CityDoctor the start.bat or start.sh should be used. It is possible to use the command in your own start scripts as needed.</p> <p>The .bat/.sh file only contains the following command (example for windows and the GUI version):</p> <pre><code>java -classpath app/*;plugins/* de.hft.stuttgart.citydoctor2.gui.CityDoctorGUIStarter\n</code></pre> <p>Note</p> <p>The exact command has changed over the development history of CityDoctor.</p> <p>For the batch version the command is similar and can be adapted for other operating systems.</p> <p>Note</p> <p>The command can also be used for Linux and Mac but the \";\" has to be replaced by \":\".</p>"},{"location":"geometric/","title":"Geometry Requirements","text":""},{"location":"geometric/#error-codes-for-geometric-errors","title":"Error codes for geometric errors","text":"<p>as defined in the CityGML Quality Interoperability Experiment, chapter 7.5.</p> <p>Note</p> <p>The requirements were renamed in CityDoctor to be more human readable. The were renamed according to the error codes.</p> <p>All the geometric errors are in the \"GE\" domain. Also, since the geometric validation is performed at 3 different levels (based on the primitives), the requirements also contain the level:</p> <ul> <li>Ring: R</li> <li>Polygon: P</li> <li>Shell: S</li> </ul> <p>Error codes follow the same system as the requirements mentioned fundamentals. A violation of each respective data quality requirement should result in an error which must be reported with an error code according to the requirement ID. For each error code, extra information can (and should) be returned. For instance: if a ring is not closed (GE_R_NOT_CLOSED) then the ID of the ring (e.g., its position (first, second..) in the polygon)  should be returned; if a polygon is not planar (GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE) then the ID of the polygon and the max. deviation from the reference plane should be returned; or if a shell is not 'watertight' (GE_S_NOT_CLOSED) then the location of the hole(s) should be returned.</p>"},{"location":"geometric/#vertex-requirement","title":"Vertex Requirement","text":"<p>Vertices A and B are the same if the euclidean distance between them is smaller than (minVertexDistance). It is also used to check whether a point is touching an edge. If a point is within minVertexDistance distance to an edge it is considered touching. This parameter is used in multiple checks with the same value:</p> <ul> <li>R_GE_R_CONSECUTIVE_POINTS_SAME</li> <li>R_GE_R_NOT_CLOSED</li> <li>R_GE_R_SELF_INTERSECTION</li> <li>R_GE_P_INTERIOR_DISCONNECTED</li> </ul> <p>The following requirements are defined for the three respective geometric levels (adopted from Ledoux (2013)):</p>"},{"location":"geometric/#linear-ring","title":"Linear Ring","text":"Requirement ID Description Error code Known checks R_GE_R_TOO_FEW_POINTS too few points GE_R_TOO_FEW_POINTS C_GE_R_TOO_FEW_POINTS R_GE_R_CONSECUTIVE_POINTS_SAME 2 consecutive points are the same GE_R_CONSECUTIVE_POINTS_SAME C_GE_R_CONSECUTIVE_POINTS_SAME, C_GE_R_DUPLICATE_POINT R_GE_R_NOT_CLOSED first-last points are not the same GE_R_NOT_CLOSED C_GE_R_NOT_CLOSED R_GE_R_SELF_INTERSECTION self-intersects, i.e., a bowtie GE_R_SELF_INTERSECTION C_GE_R_SELF_INTERSECTION, C_GE_R_DUPLICATE_POINT R_GE_R_COLLAPSED_TO_LINE Currently not in use as it is redundant with R_GE_R_SELF_INTERSECTION is point or line GE_R_COLLAPSED_TO_LINE C_GE_R_COLLAPSED_TO_LINE R_GE_R_ALL Container for: R_GE_R_TOO_FEW_POINTS, R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION -- --"},{"location":"geometric/#polygon","title":"Polygon","text":"Requirement ID Description Error code Known checks R_GE_P_INTERSECTING_RINGS 2+ rings intersect GE_P_INTERSECTING_RINGS C_GE_P_INTERSECTING_RINGS R_GE_P_NON_PLANAR Non planar polygon, both distance and normal deviation GE_P_NON_PLANAR_POLYGON_DISTANCE_PLANE, GE_P_NON_PLANAR_POLYGON_NORMALS_DEVIATION C_GE_P_NON_PLANAR R_GE_P_INTERIOR_DISCONNECTED interior is not connected GE_P_INTERIOR_DISCONNECTED C_GE_P_INTERIOR_DISCONNECTED R_GE_P_HOLE_OUTSIDE 1 or more interior rings are located outside the exterior ring GE_P_HOLE_OUTSIDE C_GE_P_HOLE_OUTSIDE R_GE_P_INNER_RINGS_NESTED interior ring is located inside other GE_P_INNER_RINGS_NESTED C_GE_P_INNER_RINGS_NESTED R_GE_P_ORIENTATION_RINGS_SAME exterior and interior rings have same orientation GE_P_ORIENTATION_RINGS_SAME C_GE_P_ORIENTATION_RINGS_SAME R_GE_P_ALL Container for: R_GE_P_INTERSECTING_RINGS, R_GE_P_NON_PLANAR, R_GE_P_INTERIOR_DISCONNECTED, R_GE_P_HOLE_OUTSIDE, R_GE_P_INNER_RINGS_NESTED, R_GE_P_ORIENTATION_RINGS_SAME, R_GE_R_ALL -- --"},{"location":"geometric/#solid-shell","title":"Solid / Shell","text":"Requirement ID Description Error code Known checks R_GE_S_TOO_FEW_POLYGONS &lt;4 polygons GE_S_TOO_FEW_POLYGONS C_GE_S_TOO_FEW_POLYGONS R_GE_S_NOT_CLOSED there is 1+ hole(s) on the surface GE_S_NOT_CLOSED C_GE_S_NOT_CLOSED R_GE_S_NON_MANIFOLD_VERTEX Each shell must be simple GE_S_NON_MANIFOLD_VERTEX C_GE_S_NON_MANIFOLD_VERTEX R_GE_S_NON_MANIFOLD_EDGE Each edge of a shell should have exactly 2 incident polygons. GE_S_NON_MANIFOLD_EDGE C_GE_S_NON_MANIFOLD_EDGE R_GE_S_MULTIPLE_CONNECTED_COMPONENTS 1+ polygons not connected to main shell GE_S_MULTIPLE_CONNECTED_COMPONENTS C_GE_S_MULTIPLE_CONNECTED_COMPONENTS R_GE_S_SELF_INTERSECTION Solid self intersects GE_S_SELF_INTERSECTION C_GE_S_SELF_INTERSECTION R_GE_S_POLYGON_WRONG_ORIENTATION orientation of a polygon not correct GE_S_POLYGON_WRONG_ORIENTATION C_GE_S_POLYGON_WRONG_ORIENTATION R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION normals all pointing in wrong direction GE_S_ALL_POLYGONS_WRONG_ORIENTATION C_GE_S_ALL_POLYGONS_WRONG_ORIENTATION R_GE_S_ALL Container for: R_GE_S_TOO_FEW_POLYGONS, R_GE_S_NOT_CLOSED, R_GE_S_NON_MANIFOLD_VERTEX, R_GE_S_NON_MANIFOLD_EDGE, R_GE_S_MULTIPLE_CONNECTED_COMPONENTS, R_GE_S_SELF_INTERSECTION, R_GE_S_POLYGON_WRONG_ORIENTATION, R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION -- --"},{"location":"geometric/#parameter-overview","title":"Parameter Overview","text":"Name Description Used in Unit minVertexDistance The minimum distance between two points before they are considered the same point R_GE_R_CONSECUTIVE_POINTS_SAME, R_GE_R_NOT_CLOSED, R_GE_R_SELF_INTERSECTION, R_GE_P_INTERIOR_DISCONNECTED Meter type Planar check type, can be distance, angle, both sein R_GE_P_NON_PLANAR - distanceTolerance Distance from the regression plane before a point is considered not in plane R_GE_P_NON_PLANAR Meter angleTolerance Difference in normal vectors before a plane is not considered planar R_GE_P_NON_PLANAR Radiant"},{"location":"geometric/#dependency-tree","title":"Dependency tree","text":"<p>This is the order the checks will be executed. If one of the depending checks is not executed or has reported an error the following check will not be executed.</p> <pre><code>graph TD;\n  X0001[R_SC_SCHEMA_VALIDATION]\n  R0001[R_GE_R_TOO_FEW_POINTS]\n  R0002[R_GE_R_CONSECUTIVE_POINTS_SAME]\n  R0003[R_GE_R_NOT_CLOSED]\n  R0004[R_GE_R_SELF_INTERSECTION]\n  P0001[R_GE_P_INTERSECTING_RINGS]\n  P0002[R_GE_P_NON_PLANAR]\n  P0003[R_GE_P_INTERIOR_DISCONNECTED]\n  P0004[R_GE_P_HOLE_OUTSIDE]\n  P0005[R_GE_P_INNER_RINGS_NESTED]\n  P0006[R_GE_P_ORIENTATION_RINGS_SAME]\n\n  S0001[R_GE_S_TOO_FEW_POLYGONS]\n  S0002[R_GE_S_NOT_CLOSED]\n  S0003[R_GE_S_NON_MANIFOLD_VERTEX]\n  S0004[R_GE_S_NON_MANIFOLD_EDGE]\n  S0005[R_GE_S_MULTIPLE_CONNECTED_COMPONENTS]\n  S0006[R_GE_S_SELF_INTERSECTION]\n  S0007[R_GE_S_POLYGON_WRONG_ORIENTATION]\n  S0008[R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION]\n\n  X0001--&gt;R0003;\n  R0003--&gt;R0001;\n  R0001--&gt;R0002;\n  R0002--&gt;R0004;\n  R0004--&gt;P0002;\n  P0002--&gt;P0006;\n  P0006--&gt;P0003;\n  P0006--&gt;P0004;\n  P0006--&gt;P0005;\n  P0004--&gt;P0001;\n  P0005--&gt;P0001;\n  P0001--&gt;S0001;\n  P0003--&gt;S0001;\n  S0001--&gt;S0002;\n  S0001--&gt;S0004;\n  S0001--&gt;S0003;\n  S0001--&gt;S0005;\n  S0002--&gt;S0007;\n  S0004--&gt;S0007;\n  S0007--&gt;S0006;\n  S0003--&gt;S0006;\n  S0005--&gt;S0006;\n  S0006--&gt;S0008; \n</code></pre>"},{"location":"geometric/#multisurface-and-solid-geometry","title":"Multisurface and Solid geometry","text":"<p>In order to simplify the definition of a validation plan, two requirement will be introduced in addition to the CityGML QIE: valid MultiSurface and valid Solid geometry. These requirements are just a collection of the linear ring, polygon and shell requirements. No extra check is required.</p> Requirement ID Description Dependencies Error code Known checks R_GE_MS valid multisurface geometry R_SC-SCHEMA-VALIDATION, R_GE_P_ALL -- -- R_GE_SO valid solid geometry R_SC-SCHEMA-VALIDATION, R_GE_S_ALL -- --"},{"location":"qual_ade/","title":"Quality-ADE","text":"<p>CityDoctor uses the Quality-ADE</p>"},{"location":"requiredSoftware/","title":"Required Software","text":""},{"location":"requiredSoftware/#versions-from-3130","title":"Versions from 3.13.0","text":"<p>Starting with version 3.13.0, a repository was created on the university's transfer portal, which will henceforth be used as a repository for finished releases:  https://transfer.hft-stuttgart.de/gitlab/citydoctor/citydoctorreleases</p> <p>The versions are divided there between CityDoctorValidation and CityDoctorGUI and under these folders there are the corresponding version folders.</p>"},{"location":"requiredSoftware/#release-versions","title":"Release Versions","text":"<p>For each CityDoctor variant (CityDoctorValidation or CityDoctorGUI) four different versions are provided for download. Java runtimes of the Liberica distribution are included in different versions. </p> Version Description CityDoctor*-no-runtime.zip This version does not include a runtime for Java. If you already have a Java version 17 installed on your PC use this. See Java CityDoctor*-win.zip Includes a Windows Java Runtime to run CityDoctor, no Java needs to be installed. CityDoctor*-lin.zip Includes a Linux Java Runtime to run CityDoctor CityDoctor*-mac.zip Includes a Mac Java Runtime to run CityDoctor"},{"location":"requiredSoftware/#versions-until-312x","title":"Versions until 3.12.x","text":"<p>CityDoctor can be downloaded from various sites. The most recent place is a gitlab repository. Alternatively, releases are also listed on the CityDoctor homepage of the BHT. There are always two versions:</p> <ul> <li>CityDoctorGUI-3.x.x.zip: This is the graphical interface including the checks. Suitable for the end user on a desktop PC.</li> <li>CityDoctorValidation-3.x.x.zip: This is the batch version suitable for integration into servers or other existing systems and has no graphical interface but works file-based as a process.</li> </ul> <p>Note</p> <p>There are sometimes special versions that have been created for testing different delivery options. Example: CityDoctorGUI-x.x.x-win.zip contains the JavaFX libraries so that a Java environment without JavaFX can also be used.</p>"},{"location":"requiredSoftware/#java","title":"Java","text":"<p>Before CityDoctor version 3.12.x Java 8 is required either as JDK or as JRE. From version 3.12.x Java 17 is required.</p> <p>Warning</p> <p>It is important that the installed Java version includes the JavaFX libraries. These are needed for the graphical user interface.</p> <p>The Liberica JRE oder JDK has proven itself for use with CityDoctor.</p> <p>Note</p> <p>The Liberica distribution is 100% free and open source.</p> <p>Note</p> <p>For the development with CityDoctor a JDK is required.</p>"},{"location":"requirements/","title":"Anforderungen und Pr\u00fcfungen f\u00fcr die Validierung von CityGML-Modellen","text":"<p>The requirements are the basic building blocks for a validation plan to validate CityGML models. For naming conventions and definitions, see fundamentals.  </p> <p>A requirement can be validated by one or more checks. A check validates one or more requirements on a model. Each check can have preconditions. If these preconditions are not met, the check is not executed. A distinction is made between:</p> <ul> <li>Schema Requirements</li> <li>Geometry Requirements</li> <li>Semantic Requirements</li> </ul>"},{"location":"schemaRequirements/","title":"Schema Requirements","text":""},{"location":"schemaRequirements/#r_sc_schema_validation","title":"R_SC_SCHEMA_VALIDATION","text":""},{"location":"schemaRequirements/#anforderung","title":"Anforderung","text":"ID R_SC_SCHEMA_VALIDATION Description A basic requirement is that each CityGML document must be well defined and XSD valid. Error code SC-SCHEMA-NOT-VALID"},{"location":"schemaRequirements/#prufung","title":"Pr\u00fcfung","text":"ID SC_SCHEMA_VALIDATION Anforderungs ID R_SC_SCHEMA_VALIDATION Requirements none Description Tools to perform XSD validation are available and give reliable results Error code SC_SCHEMA_NOT_VALID"},{"location":"semantic/","title":"Semantic Requirements","text":"<p>The semantic requirements are mostly attribute based. This results in 3 error states for an attribute:</p> <ul> <li>SE_ATTRIBUTE_WRONG_VALUE: If an attribute has a wrong value.</li> <li>SE_ATTRIBUTE_MISSING: If an attribute is missing but should be present.</li> <li>SE_ATTRIBUTE_INVALID: If an attribute is present but forbidden.</li> </ul>"},{"location":"semantic/#schematron","title":"Schematron","text":"<p>In CityDoctor wurde das XML Validierungssystem Schematron integriert um flexibel Attributpr\u00fcfungen anzupassen und zu unterst\u00fctzen. </p> <p>Hier ist ein Beispiel f\u00fcr eine Schematron Datei die CityDoctor integrieren kann:</p>"},{"location":"semantic/#citydoctor-3130","title":"CityDoctor &gt;= 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n\n</code></pre>"},{"location":"semantic/#citydoctor-3130_1","title":"CityDoctor &lt; 3.13.0","text":"<pre><code>&lt;?xml version=\"1.0\" encoding=\"UTF-8\"?&gt;\n&lt;schema xmlns=\"http://purl.oclc.org/dsdl/schematron\" queryBinding=\"xslt2\"&gt;\n    &lt;ns prefix=\"gml\" uri=\"http://www.opengis.net/gml\"/&gt;\n    &lt;ns prefix=\"bldg\" uri=\"http://www.opengis.net/citygml/building/2.0\"/&gt;\n\n    &lt;pattern&gt;\n        &lt;rule context=\"//*:Building\"&gt;\n            &lt;assert test=\"count(descendant::*:lod1Solid) &amp;gt; 0 or count(descendant::*:lod2Solid) &amp;gt; 0 or count(descendant::*:lod3Solid) &amp;gt; 0 or count(descendant::*:lod4Solid) &amp;gt; 0\"&gt;&lt;value-of select=\"@gml:id | @id\"/&gt;||||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n        &lt;rule context=\"//*:BuildingPart\"&gt;\n            &lt;assert test=\"count(*:lod1Solid) = 1 or count(*:lod2Solid) = 1 or count(*:lod3Solid) = 1 or count(*:lod4Solid) = 1\"&gt;&lt;value-of select=\"ancestor::*:Building/@*:id\"/&gt;||&lt;value-of select=\"@gml:id | @id\"/&gt;||SE_ATTRIBUTE_MISSING||any solid||false&lt;/assert&gt;\n        &lt;/rule&gt;\n    &lt;/pattern&gt;\n&lt;/schema&gt; \n</code></pre> <p>Diese Datei pr\u00fcft, dass alle Buildings in sich selbst oder in einem ihrer Unterelementen ein Solid beliebigen LODSs vorhanden ist. Au\u00dferdem stellt die Datei sicher, dass jedes BuildingPart ein Solid enth\u00e4lt. Wenn dies nicht der Fall ist wird eine Fehlermeldung ausgegeben. Die Fehlermeldung ist dabei so formattiert, dass CityDoctor sie interpretieren und in das interne Datenmodell einbinden kann.</p>"},{"location":"semantic/#fehlerformat","title":"Fehlerformat","text":"<p>Das Fehlerformat ist ein CSV-Format mit || als Trennzeichen</p> <pre><code>parent id||child id||error code||error type||is generic attribute\n</code></pre> <p>Die Fehlermeldung besteht aus den folgenden Teilen:</p> <ul> <li>Die <code>parent id</code> ist die gml id des obersten Elements z.B. Building oder Bridge. </li> <li>Falls der Fehler in einem Unterelement aufgetreten ist so kann diese ID in dem Feld f\u00fcr die <code>child id</code> eingetragen werden.</li> <li>Im Feld <code>error type</code> ist einer der 3 Fehlertypen einzutragen: <code>SE_ATTRIBUTE_WRONG_VALUE, SE_ATTRIBUTE_MISSING, SE_ATTRIBUTE_INVALID</code>.</li> </ul> <p>note Nur in CityDoctor &lt; 3.13.0: * Um ein generisches Attribut mit dem Namen <code>measuredHeight</code> von dem nicht generischen Attribut zu unterscheiden ist im letzten Feld vorgesehen <code>true</code> einzutragen wenn es sich um ein generisches Attribut handelt ansonsten <code>false</code>. </p>"},{"location":"udt_about/","title":"UDigiT-Doctor","text":"<p>Expansion of CityDoctor2 to enable integration with urban digital twins</p> <p></p> <p>The UDigiT-Doctor project continues the development of CityDoctor2, with the goal of enabling the validation and repair of urban digital twins with CityDoctor.</p>"},{"location":"udt_about/#objectives","title":"Objectives","text":"<p>In summary, the following scientific and technical objectives can be derived to allow for a transfer of the validation functionality of CityDoctor to urban digital twins:</p> <ul> <li>Design of an internal data model and methods for the creation of an integrated complete model. </li> <li>Validation of the topological relations between objects, to assure data consistency of a generic base building model and specific use-cases (e.g. gas/water/electricity supply networks and their respective building service-connections)</li> <li>Improving repair and validation functionality by incorporating comparisons with reference data. </li> <li>Extensive, modifiable validation functionality for semantical data.</li> </ul>"},{"location":"udt_about/#license","title":"License","text":"<p>UDigiT-Doctor, being an update of CityDoctor2, will continue to be released under the LGPL as FOSS.</p>"},{"location":"udt_about/#releases","title":"Releases","text":"<p>Releases of UDigiT-Doctor will be made available via the CityDoctor2 GitLab-repository.</p>"},{"location":"udt_about/#project-information","title":"Project Information","text":"<p>Project Duration: April 01, 2024 - July 01, 2027</p> <p>Project Website: UDigiT-Doctor: Hochschule f\u00fcr Technik Stuttgart UDigiT-Doctor: Berliner Hochschule f\u00fcr Technik</p> <p>Project Lead: Prof. Dr.-Ing. Volker Coors</p> <p>Collaboration Partner: Prof. Dr. Margitta Pries</p>"},{"location":"udt_about/#partners","title":"Partners","text":"<p>Cooperation Partners: Robert Bosch GmbH Geoplex GIS GmbH M.O.S.S. Computer Grafik Systeme GmbH LandPlan OS GmbH Point Cloud Technology GmbH virtualcitysystems GmbH</p> <p>Associative Partners: Open Geospatial Consortium Stadt Stuttgart Stadt Leverkusen </p> <p>Funding: Bundesamt f\u00fcr Bildung und Forschung</p> <p>Promoter: VDI Technologiezentrum </p>"},{"location":"udt_req_data_model/","title":"Requirements of the internal data model","text":""},{"location":"udt_req_data_model/#urban-digital-twin-data","title":"Urban digital twin data","text":"<p>In order to be able to validate and repair the models of urban digital twins, CityDoctor needs the capability to access their data.</p>"},{"location":"udt_req_data_model/#reference-model","title":"Reference model","text":"<p>While CityDoctor is capable of repairing geometrical errors, the repaired model can contain discrepancies with the real object. This is expected, since CityDoctor purely operates via model data. To alleviate this, functionalities for the usage of a reference model are desired. The reference model would allow CityDoctor to determine the quality of a repair step, enabling the implementation of more sophisticated healing-routines.</p>"},{"location":"udt_req_data_model/#data-format-support","title":"Data format support","text":"<p>The aforementioned requirements revolve around data that is not compatible with, or available as, CityGML. Therefore, to </p>"},{"location":"udt_req_overview/","title":"Requirements of UDigiT-Doctor","text":"<ol> <li>Design of an internal data model and methods for the creation of an integrated complete model.</li> <li>Validation of the topological relations between objects, to assure data consistency of a generic base building model and specific use-cases (e.g. gas/water/electricity supply networks and their respective building service-connections)</li> <li>Improving repair and validation functionality by incorporating comparisons with reference data.</li> <li>Extensive, modifiable validation functionality for semantical data.</li> </ol> Specific requirements of Applicable to requirement nr. Data model 1., 2., 3. Topological consistency 2., 3. Semantical validation 2., 4."},{"location":"udt_terms/","title":"Validation of urban digital twins","text":""},{"location":"udt_terms/#terms-and-definitions","title":"Terms and definitions","text":"<p>See also: Terms and definitions of CityDoctor2</p> <p>Urban digital twin</p> <p>An urban digital twin is a virtual, representative model of a real building. Digital twins are useful for various tasks, e.g. the simulation of certain processes. They also serve as a central access point to information and data of the building, including access to installed sensors and building management systems.</p>"},{"location":"userInterface/","title":"User interface","text":""},{"location":"userInterface/#citydoctor","title":"CityDoctor","text":"<p>In the upper bar the following buttons are in order:</p> <ul> <li>Load: Opens the dialog for loading a CityGML file</li> <li>Validation: Opens the dialog to check a loaded CityGML</li> <li>Validation results: Opens the dialog for writing a test protocol in xml or pdf form</li> <li>Grid: Shows/hides the grid instead of filled polygons</li> <li>Backsides: Shows/hides backs of polygons</li> <li>Global View: Loads all elements of a CityGML into the view</li> <li>LODs: Turns individual LODs on or off from the view</li> <li>Save: Saves a CityGML file back, if the file was checked the QualityADE is written too.</li> <li>About: Opens the dialog with information about the project CityDoctor2</li> <li>View: Switches different views. There is only one for the validation part.</li> <li>Language: Here you can set the language (German/English)</li> </ul> <p>Warning</p> <p>Displaying the Global View can cause crashes with large CityGML files (&gt; 100mb depending on the system). The display may take a short time.</p>"},{"location":"userInterface/#load","title":"Load","text":"<p>The Load button opens the dialog for loading a CityGML file.</p> <p></p> <p>In the file bar a file path can be entered or selected via the Select button.</p> <p>In addition, other settings for reading the file can be specified.</p> <ul> <li>NumberOfRoundingPlaces: To how many decimal places are the read-in values rounded?</li> <li>XML-Validierung: Performs an XML validation. Errors are detected directly during the import and the import is aborted.</li> <li>Low Memory Consumption Mode : Saves RAM to allow larger files in the GUI. Slight performance costs during the validation process.</li> </ul> <p>When loading, the progress is approximately represented by the loading bar.</p> <p>Note</p> <p>Files can also be dragged and dropped directly from the file manager into the GUI without using the load dialog. The default values are assumed (8 decimal places, no XML validation).</p> <p>After loading a CityGML file, the elements are displayed in the individual tabs. Selecting an element will display it in the view.</p> <p></p> <p>Note</p> <p>By selecting the top element of a tab, all elements within this tab are displayed. As the above warning states, larger amounts of data will cause crashes.</p>"},{"location":"userInterface/#validation","title":"Validation","text":"<p>The validation plan can be customized in the check dialog. In addition to the available checks, the global parameters are also displayed here.</p> <p>The parameters can be changed with a double click in the value column. The unit is fixed.</p> <p>Note</p> <p>The numberOfRoundingPlaces parameter cannot be changed. It was set when the file was loaded.</p> <p>If checks should not be executed, they can be deactivated in the Active column.</p> <p>Warning</p> <p>If checks are disabled but other active checks need them as dependencies, they will be re-enabled during the check to ensure stability. See Requirements.</p> <p>In the Schematron file field, a path to a Schematron file can be entered. In this file flexible rules for the semantic requirements can be defined. See Semantic Requirements</p> <p>The test plan can be saved and loaded via the two buttons at the top right.</p> <p>After the check, elements with errors are colored red and elements without errors are colored green. When selecting an element that contains errors, the errors are displayed in the lower tab Errors. There you can select the error to display it in CityDoctor and get more information.</p> <p></p> <p>The elements can be filtered with the dropdown menu to show only faulty elements.</p>"},{"location":"userInterface/#validation-reports","title":"Validation reports","text":"<p>In this dialog there is again an overview of the errors in image form and the possibility to write an xml or pdf report.</p> <p></p>"},{"location":"validationPlan/","title":"Validation Plan","text":"<p>the validation plan for CityDoctor is specified in YAML.</p> <p>For version 3.12.x and later, an example looks like this:</p> <pre><code>globalParameters:\n   numberOfRoundingPlaces: 8\n   # in m\n   minVertexDistance: 0.0001\n   schematronPath: 'checkForSolid.xml'\nuseStreaming: true # (1)!\nrequirements:\n   R_GE_R_TOO_FEW_POINTS:\n      enabled: true\n   R_GE_R_NOT_CLOSED:\n      enabled: true\n   R_GE_R_CONSECUTIVE_POINTS_SAME:\n      enabled: true\n   R_GE_R_SELF_INTERSECTION:\n      enabled: true\n   R_GE_S_MULTIPLE_CONNECTED_COMPONENTS:\n      enabled: true\n   R_GE_P_INTERIOR_DISCONNECTED:\n      enabled: true\n   R_GE_P_INTERSECTING_RINGS:\n      enabled: true\n   R_GE_P_NON_PLANAR:\n      enabled: true\n      parameters:\n         # one of (\"distance\", \"angle\", \"both\")\n         type: distance\n         # in m\n         distanceTolerance: 0.01\n         # in degree\n         angleTolerance: 1\n   R_GE_P_HOLE_OUTSIDE:\n      enabled: true\n   R_GE_P_ORIENTATION_RINGS_SAME:\n      enabled: true\n   R_GE_P_INNER_RINGS_NESTED:\n      enabled: true\n   R_GE_S_TOO_FEW_POLYGONS:\n      enabled: true\n   R_GE_S_NOT_CLOSED:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_EDGE:\n      enabled: true\n   R_GE_S_POLYGON_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_ALL_POLYGONS_WRONG_ORIENTATION:\n      enabled: true\n   R_GE_S_NON_MANIFOLD_VERTEX:\n      enabled: true\n   R_GE_S_SELF_INTERSECTION:\n      enabled: true\n   R_SE_BS_IS_WALL:\n      enabled: false\n      parameters:\n            lowerAngle: '45'\n            upperAngle: '135'\n   R_SE_BS_IS_FLOOR:\n      enabled: false\n   R_SE_BS_GROUND_UNFRAGMENTED:\n      enabled: false\n   R_SE_BS_IS_GROUND:\n      enabled: false\n   R_SE_BS_IS_CEILING:\n      enabled: false\n</code></pre> <ol> <li>The parameter <code>useStreaming</code> is a switch to read a file piece by piece instead of reading the complete file before the check takes place. With this setting also files &gt; 2GB can be checked without large RAM requirements.</li> </ol> <p>In the validation plan you will find the same settings that are listed in the graphical user interface.</p> <p>All requirements that are to be checked are listed under requirements. The semantic checks are deactivated by default. </p>"},{"location":"zipFiles/","title":"Zip Archives","text":"<p>CityDoctor is capable of parsing zip archives to enable the validation of contained CityGML files.</p>"},{"location":"zipFiles/#loading-a-zip-archive","title":"Loading a zip archive","text":"<p>To load a zip archive, select a zip file using file loading dialoge. CityDoctor will analyze the zip file for potential CityGml files.</p>"},{"location":"zipFiles/#zip-entry-manager","title":"Zip entry manager","text":"<p>CityDoctor will show the zip entry manager after successfully loading a zip archive. The zip entry manager has the following buttons:  </p> <ol> <li>Show model: Shows the city model of the selected entry in the main window of CityDoctor, giving access to the normal CityDoctor functionality. Only available for decompressed entries.</li> <li>Decompress entry: Decompresses the selected entry.</li> <li>Error statistics: Shows the error statistics of the selected entry. Only available for validated entries.</li> <li>Decompress all entries: Decompresses all entries of the archive.</li> <li>Check all: Opens the checking dialoge, allowing batch validation of all entries. See validation for more details.</li> <li>Save reports: Allows saving of validation reports. Available after at least one entry has been validated.</li> </ol> <p></p> <p>Entries display their current state via color coding. Possible states are:</p> <ul> <li>compressed(black): A compressed entry is still 'zipped'.</li> <li>decompressed(blue): A decompressed entry has been successfully 'unzipped' into the memory.</li> <li>empty model(gray): A decompressed entry containing no city model or a model without any city objects.</li> <li>erroneous entry(dark red): An entry which could not be successfully decompressed, due to either having an invalid CityGML file, being too big to be held in memory or encountering a problem while reading the file. The respective reason will be shown in the entry's metadata.</li> <li>validated with / without errors (bright red / green respectively)</li> </ul> <p>Note</p> <p>The original zip file or its entries will not be changed. Decompressed data is a copy of the source entry.</p>"},{"location":"zipFiles/#validation","title":"Validation","text":""},{"location":"zipFiles/#validation-of-individual-entries","title":"Validation of individual entries","text":"<p>Decompressed entries can be validated individually through the CityDoctor main window. CityDoctor will retain the validation results for each entry in memory until the application is closed or a new zip archive is loaded.</p>"},{"location":"zipFiles/#batch-validation","title":"Batch validation","text":"<p>The \"Check all\" button in the zip entry manager opens the option window for the batch validation. This process does not require prior decompression of the entries and offers two modes of operation:</p>"},{"location":"zipFiles/#default-mode","title":"Default mode","text":"<p>The default batch validation mode validates each entry within the archive. Compressed entries will be automatically decompressed during this process. Like with the individual validation, the results are held in memory and can be inspected in CityDoctor.</p>"},{"location":"zipFiles/#low-memory-mode-stream-mode","title":"Low memory mode (stream mode)","text":"<p>Low memory mode utilizes datastreams to read and check the city model features individually. This significantly decreases memory overhead and usage by eliminating the need for entry decompression. However, this also means that the state of entries remains unchanged. As a result, the results of the validation cannot be inspected within CityDoctor and will be recorded in report files at the designated output location.</p>"}]}
\ No newline at end of file