Fachrat Informatik - Forum

Source code

  // _w und _h initialisieren
  if (viewmode==0) { //transversale Sicht
    _w = active_file.getImageWidth();
    _h = active_file.getImageHeight();
  }
  else if (viewmode==1) { //sagittale Sicht
    _w = _slices.getImageHeight();	
    _h = _slices.getNumberOfImages();
  }
  else if (viewmode==2) { //frontale Sicht
   _w = _slices.getImageWidth();
   _h = _slices.getNumberOfImages();
  }
		
	
  // _w and _h need to be initialized BEFORE filling the image array !
  if (_bg_img==null || _bg_img.getWidth(null)!=_w || _bg_img.getHeight(null)!=_h) {
    reallocate();
  }

Source code

private void reallocate() {
  _w = _slices.getImageWidth();
  _h = _slices.getImageHeight();
		
  _bg_pixels = new int[_w*_h];
  _bg_mis = new MemoryImageSource(_w, _h, _bg_pixels, 0, _w);
  _bg_mis.setAnimated(true);
  _bg_img = createImage(_bg_mis);
...
usw.

Java source code

		public void laplace_smooth(Vector<Point3f> vertices, Vector<Integer> triangles, int numIterations)
		{
			//Nachbarschaft der Punkte berechnen
			Vector<Set<Integer>> neighborhoods = new Vector<Set<Integer>>(vertices.size());
			neighborhoods.setSize(vertices.size());
			for(int i = 0; i < vertices.size(); ++i)
				neighborhoods.set(i, new CopyOnWriteArraySet<Integer>());
			
			for(int i = 0; i < triangles.size(); i += 3)
			{
				int i0 = triangles.get(i+0);
				int i1 = triangles.get(i+1);
				int i2 = triangles.get(i+2);
				
				neighborhoods.get(i0).add(i1);
				neighborhoods.get(i0).add(i2);
				
				neighborhoods.get(i1).add(i0);
				neighborhoods.get(i1).add(i2);

				neighborhoods.get(i2).add(i0);
				neighborhoods.get(i2).add(i1);
			}

			//jeden Punkt ins Zentrum seiner topologischen Nachbarn ziehen
			for(int iter = 0; iter < numIterations; ++iter)
			{
				System.out.println("iteration " + iter);
				Vector<Point3f> temp_vertices = new Vector<Point3f>(vertices.size());
				temp_vertices.setSize(vertices.size());
				for(int i = 0; i < vertices.size(); ++i)
				{
					Point3f p = new Point3f(0,0,0);
					int count = 0;
					for(int n : neighborhoods.get(i))
					{
						p.add(vertices.get(n));
						++count;
					}
					
					p.scale(1.0f/count);
					temp_vertices.set(i, p);
				}
				
				for(int i = 0; i < vertices.size(); ++i) {
					vertices.set(i, temp_vertices.get(i));
				}
			}
		}