File: vtkCellCenterDepthSort.h

package info (click to toggle)
vtk 5.0.2-4
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 51,080 kB
  • ctags: 67,442
  • sloc: cpp: 522,627; ansic: 221,292; tcl: 43,377; python: 14,072; perl: 3,102; java: 1,436; yacc: 1,033; sh: 469; lex: 248; makefile: 181; asm: 154
file content (78 lines) | stat: -rwxr-xr-x 2,574 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*=========================================================================

  Program:   Visualization Toolkit
  Module:    $RCSfile: vtkCellCenterDepthSort.h,v $

  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
  All rights reserved.
  See Copyright.txt or http://www.kitware.com/Copyright.htm for details.

     This software is distributed WITHOUT ANY WARRANTY; without even
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
     PURPOSE.  See the above copyright notice for more information.

=========================================================================*/

/*
 * Copyright 2003 Sandia Corporation.
 * Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive
 * license for use of this work by or on behalf of the
 * U.S. Government. Redistribution and use in source and binary forms, with
 * or without modification, are permitted provided that this Notice and any
 * statement of authorship are reproduced on all copies.
 */

// .NAME vtkCellCenterDepthSort - A simple implementation of vtkCellDepthSort.
//
// .SECTION Description
// vtkCellCenterDepthSort is a simple and fast implementation of depth
// sort, but it only provides approximate results.  The sorting algorithm
// finds the centroids of all the cells.  It then performs the dot product
// of the centroids against a vector pointing in the direction of the
// camera transformed into object space.  It then performs an ordinary sort
// on the result.
//

#ifndef __vtkCellCenterDepthSort_h
#define __vtkCellCenterDepthSort_h

#include "vtkVisibilitySort.h"

class vtkFloatArray;

class vtkCellCenterDepthSortStack;

class VTK_GRAPHICS_EXPORT vtkCellCenterDepthSort : public vtkVisibilitySort
{
public:
  vtkTypeRevisionMacro(vtkCellCenterDepthSort, vtkVisibilitySort);
  virtual void PrintSelf(ostream &os, vtkIndent indent);
  static vtkCellCenterDepthSort *New();

  virtual void InitTraversal();
  virtual vtkIdTypeArray *GetNextCells();

protected:
  vtkCellCenterDepthSort();
  virtual ~vtkCellCenterDepthSort();

  vtkIdTypeArray *SortedCells;
  vtkIdTypeArray *SortedCellPartition;

  vtkFloatArray *CellCenters;
  vtkFloatArray *CellDepths;
  vtkFloatArray *CellPartitionDepths;

  virtual float *ComputeProjectionVector();
  virtual void ComputeCellCenters();
  virtual void ComputeDepths();

private:
  vtkCellCenterDepthSortStack *ToSort;

  vtkCellCenterDepthSort(const vtkCellCenterDepthSort &);  // Not implemented.
  void operator=(const vtkCellCenterDepthSort &);  // Not implemented.
};

#endif //__vtkCellCenterDepthSort_h