All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.bimserver.GeometrySimplifier Maven / Gradle / Ivy

There is a newer version: 1.5.9
Show newest version
package org.bimserver;

/******************************************************************************
 * Copyright (C) 2009-2016  BIMserver.org
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 * 
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see {@literal}.
 *****************************************************************************/

import java.nio.ByteBuffer;
import java.nio.ByteOrder;
import java.nio.FloatBuffer;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

import org.bimserver.models.geometry.GeometryData;
import org.bimserver.models.ifc2x3tc1.IfcProduct;
import org.eclipse.emf.ecore.EClass;

public class GeometrySimplifier {

	private final Map>> data = new HashMap>>();

	public void add(IfcProduct ifcProduct, GeometryData geometryData) {
		Map> ofType = data.get(ifcProduct.eClass());
		if (ofType == null) {
			ofType = new HashMap<>();
			data.put(ifcProduct.eClass(), ofType);
		}
		Set set = ofType.get(geometryData.getVertices().length);
		if (set == null) {
			set = new HashSet();
			ofType.put(geometryData.getVertices().length, set);
		}
		set.add(geometryData);
	}

	public Set getMatchingGeometry(IfcProduct ifcProduct, GeometryData geometryData) {
		Set result = new HashSet<>();
		Map> ofType = data.get(ifcProduct.eClass());
		if (ofType != null) {
			Set set = ofType.get(geometryData.getVertices().length);
			if (set != null) {
				for (GeometryData d : set) {
					if (d != ifcProduct.getGeometry().getData()) {
						if (matchExactlyTheSame(geometryData, d)) {
							result.add(d);
						} else if (matchSameOrder(geometryData, d)) {
							result.add(d);
//					} else if (matchTotalDistance(geometryData, d)) {
//						return d;
						}
					}
				}
			}
		}
		return result;
	}
	
//	private boolean matchTotalDistance(GeometryData geometryData, GeometryData d) {
//		FloatBuffer buffer1 = ByteBuffer.wrap(geometryData.getVertices()).asFloatBuffer();
//		FloatBuffer buffer2 = ByteBuffer.wrap(d.getVertices()).asFloatBuffer();
//		float lastX1 = buffer1.get(0);
//		float lastY1 = buffer1.get(1);
//		float lastZ1 = buffer1.get(2);
//		float lastX2 = buffer2.get(0);
//		float lastY2 = buffer2.get(1);
//		float lastZ2 = buffer2.get(2);
//		double totalDistance1 = 0;
//		double totalDistance2 = 0;
//		for (int i=3; i 0.1 || diff < -0.1) {
				return false;
			}
			lastX1 = buffer1.get(i);
			lastY1 = buffer1.get(i+1);
			lastZ1 = buffer1.get(i+2);
			lastX2 = buffer2.get(i);
			lastY2 = buffer2.get(i+1);
			lastZ2 = buffer2.get(i+2);
		}
		return true;
	}

	private boolean matchExactlyTheSame(GeometryData geometryDate, GeometryData d) {
		ByteBuffer bb1 = ByteBuffer.wrap(geometryDate.getVertices());
		bb1.order(ByteOrder.LITTLE_ENDIAN);
		FloatBuffer buffer1 = bb1.asFloatBuffer();
		ByteBuffer bb2 = ByteBuffer.wrap(d.getVertices());
		bb2.order(ByteOrder.LITTLE_ENDIAN);
		FloatBuffer buffer2 = bb2.asFloatBuffer();
		if (buffer1.capacity() != buffer2.capacity()) {
			return false;
		}
		for (int i=0; i




© 2015 - 2024 Weber Informatics LLC | Privacy Policy