gnuplot-old/src/pm3d.c at gnuplot-4-4-alpha · gnuplot/gnuplot-old · GitHub

Repository navigation

History

1134 lines (1015 loc) · 35.5 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

949

950

951

952

953

954

955

956

957

958

959

960

961

962

963

964

965

966

967

968

969

970

971

972

973

974

975

976

977

978

979

980

981

982

983

984

985

986

987

988

989

990

991

992

993

994

995

996

997

998

999

1000

#ifndef lint

static char *RCSid() { return RCSid("$Id: pm3d.c,v 1.77 2009/03/26 00:49:16 sfeam Exp $"); }

#endif

/* GNUPLOT - pm3d.c */

/*[

* Petr Mikulik, since December 1998

* Copyright: open source as much as possible

* What is here: global variables and routines for the pm3d splotting mode.

* This file is included only if PM3D is defined.

]*/

#ifdef HAVE_CONFIG_H

# include "config.h"

#endif

#include "pm3d.h"

#include "alloc.h"

#include "axis.h"

#include "graphics.h"

#include "graph3d.h"

#include "hidden3d.h" /* p_vertex & map3d_xyz() */

#include "plot2d.h"

#include "plot3d.h"

#include "setshow.h" /* for surface_rot_z */

#include "term_api.h" /* for lp_use_properties() */

#include "command.h" /* for c_token */

#include <stdlib.h> /* qsort() */

Global options for pm3d algorithm (to be accessed by set / show).

pm3d_struct pm3d = {

"s", /* where[6] */

PM3D_FLUSH_BEGIN, /* flush */

0, /* no flushing triangles */

PM3D_SCANS_AUTOMATIC, /* scans direction is determined automatically */

PM3D_CLIP_4IN, /* clipping: all 4 points in ranges */

0, /* no pm3d hidden3d is drawn */

PM3D_EXPLICIT, /* implicit */

PM3D_WHICHCORNER_MEAN, /* color from which corner(s) */

1, /* interpolate along scanline */

1 /* interpolate between scanlines */

};

typedef struct {

double gray;

double z; /* maximal z value after rotation to graph coordinate system */

gpdPoint corners[4];

gpiPoint icorners[4]; /* also if EXTENDED_COLOR_SPECS is not defined */

} quadrangle;

static int allocated_quadrangles = 0;

static int current_quadrangle = 0;

static quadrangle* quadrangles = (quadrangle*)0;

/* Internal prototypes for this module */

static TBOOLEAN plot_has_palette;

static double geomean4 __PROTO((double, double, double, double));

static double median4 __PROTO((double, double, double, double));

static void pm3d_plot __PROTO((struct surface_points *, int));

static void pm3d_option_at_error __PROTO((void));

static void pm3d_rearrange_part __PROTO((struct iso_curve *, const int, struct iso_curve ***, int *));

static void filled_color_contour_plot __PROTO((struct surface_points *, int));

* Utility routines.

/* Geometrical mean = pow( prod(x_i > 0) x_i, 1/N )

* Sign of the result: result is positive if 3 or 4 x_i are positive,

* it is negative if 3 or all 4 x_i are negative. Helps to splot surface

* with all color coordinates negative.

static double

geomean4 (double x1, double x2, double x3, double x4)

{

#if 0

/* return 0 if any of the number is negative */

if (x1 <= 0) x1 = 1;

if (x2 > 0) x1 *= x2;

if (x3 > 0) x1 *= x3;

if (x4 > 0) x1 *= x4;

return pow(x1, 0.25);

#else

/* honor signess, i.e. sign(geomean) = sign(prod(x_i)) */

int neg = (x1 < 0) + (x2 < 0) + (x3 < 0) + (x4 < 0);

x1 *= x2 * x3 * x4;

if (x1 == 0) return 0;

/* pow(x, 0.25) is slightly faster than sqrt(sqrt(x)) */

x1 = sqrt(sqrt(fabs(x1)));

#if 0

/* such a warning could be helpful, but under normal usage it is just an overhead */

if (neg > 1 && interactive && notwarned) {

int notwarned = 1; ... to be set on every new splot

if (notwarned)

int_warn(NO_CARET, "corners2color geomean with negative data points");

notwarned = 0;

}

#endif

return (neg <= 2) ? x1 : -x1;

#endif

}

/* Median: sort values, and then: for N odd, it is the middle value; for N even,

* it is mean of the two middle values.

static double

median4 (double x1, double x2, double x3, double x4)

{

double tmp;

/* sort them: x1 < x2 and x3 < x4 */

if (x1 > x2) { tmp = x2; x2 = x1; x1 = tmp; }

if (x3 > x4) { tmp = x3; x3 = x4; x4 = tmp; }

/* sum middle numbers */

tmp = (x1 < x3) ? x3 : x1;

tmp += (x2 < x4) ? x2 : x4;

return tmp * 0.5;

}

/* Minimum of 4 numbers.

static double

minimum4 (double x1, double x2, double x3, double x4)

{

x1 = GPMIN(x1, x2);

x3 = GPMIN(x3, x4);

return GPMIN(x1, x3);

}

/* Maximum of 4 numbers.

static double

maximum4 (double x1, double x2, double x3, double x4)

{

x1 = GPMAX(x1, x2);

x3 = GPMAX(x3, x4);

return GPMAX(x1, x3);

}

* Now the routines which are really just those for pm3d.c

* Rescale z to cb values. Nothing to do if both z and cb are linear or log of the

* same base, other it has to un-log z and subsequently log it again.

double

z2cb(double z)

{

if (!Z_AXIS.log && !CB_AXIS.log) /* both are linear */

return z;

if (Z_AXIS.log && !CB_AXIS.log) /* log z, linear cb */

return exp(z * Z_AXIS.log_base); /* unlog(z) */

if (!Z_AXIS.log && CB_AXIS.log) /* linear z, log cb */

return (log(z) / CB_AXIS.log_base);

/* both are log */

if (Z_AXIS.base==CB_AXIS.base) /* can we compare double numbers like that? */

return z;

return z * Z_AXIS.log_base / CB_AXIS.log_base; /* log_cb(unlog_z(z)) */

}

* Rescale cb (color) value into the interval of grays [0,1], taking care

* of palette being positive or negative.

* Note that it is OK for logarithmic cb-axis too.

double

cb2gray(double cb)

{

if (cb <= CB_AXIS.min)

return (sm_palette.positive == SMPAL_POSITIVE) ? 0 : 1;

if (cb >= CB_AXIS.max)

return (sm_palette.positive == SMPAL_POSITIVE) ? 1 : 0;

cb = (cb - CB_AXIS.min)

/ (CB_AXIS.max - CB_AXIS.min);

return (sm_palette.positive == SMPAL_POSITIVE) ? cb : 1-cb;

}

* Rearrange...

static void

pm3d_rearrange_part(

struct iso_curve *src,

const int len,

struct iso_curve ***dest,

int *invert)

{

struct iso_curve *scanA;

struct iso_curve *scanB;

struct iso_curve **scan_array;

int i, scan;

int invert_order = 0;

/* loop over scans in one surface

Scans are linked from this_plot->iso_crvs in the opposite order than

they are in the datafile.

Therefore it is necessary to make vector scan_array of iso_curves.

Scans are sorted in scan_array according to pm3d.direction (this can

be PM3D_SCANS_FORWARD or PM3D_SCANS_BACKWARD).

scan_array = *dest = gp_alloc(len * sizeof(scanA), "pm3d scan array");

if (pm3d.direction == PM3D_SCANS_AUTOMATIC) {

int cnt;

int len2 = len;

TBOOLEAN exit_outer_loop = 0;

for (scanA = src; scanA && 0 == exit_outer_loop; scanA = scanA->next, len2--) {

int from, i;

vertex vA, vA2;

if ((cnt = scanA->p_count - 1) <= 0)

continue;

/* ordering within one scan */

for (from=0; from<=cnt; from++) /* find 1st non-undefined point */

if (scanA->points[from].type != UNDEFINED) {

map3d_xyz(scanA->points[from].x, scanA->points[from].y, 0, &vA);

break;

}

for (i=cnt; i>from; i--) /* find the last non-undefined point */

if (scanA->points[i].type != UNDEFINED) {

map3d_xyz(scanA->points[i].x, scanA->points[i].y, 0, &vA2);

break;

}

if (i - from > cnt * 0.1)

/* it is completely arbitrary to request at least

* 10% valid samples in this scan. (joze Jun-05-2002) */

*invert = (vA2.z > vA.z) ? 0 : 1;

else

continue; /* all points were undefined, so check next scan */

/* check the z ordering between scans

* Find last scan. If this scan has all points undefined,

* find last but one scan, an so on. */

for (; len2 >= 3 && !exit_outer_loop; len2--) {

for (scanB = scanA-> next, i = len2 - 2; i && scanB; i--)

scanB = scanB->next; /* skip over to last scan */

if (scanB && scanB->p_count) {

vertex vB;

for (i = from /* we compare vA.z with vB.z */; i<scanB->p_count; i++) {

/* find 1st non-undefined point */

if (scanB->points[i].type != UNDEFINED) {

map3d_xyz(scanB->points[i].x, scanB->points[i].y, 0, &vB);

invert_order = (vB.z > vA.z) ? 0 : 1;

exit_outer_loop = 1;

break;

}

FPRINTF((stderr, "(pm3d_rearrange_part) invert = %d\n", *invert));

FPRINTF((stderr, "(pm3d_rearrange_part) invert_order = %d\n", invert_order));

for (scanA = src, scan = len - 1, i = 0; scan >= 0; --scan, i++) {

if (pm3d.direction == PM3D_SCANS_AUTOMATIC) {

switch (invert_order) {

case 1:

scan_array[scan] = scanA;

break;

case 0:

default:

scan_array[i] = scanA;

break;

}

} else if (pm3d.direction == PM3D_SCANS_FORWARD)

scan_array[scan] = scanA;

else /* PM3D_SCANS_BACKWARD: i counts scans */

scan_array[i] = scanA;

scanA = scanA->next;

}

* Rearrange scan array

* Allocates *first_ptr (and eventually *second_ptr)

* which must be freed by the caller

void

pm3d_rearrange_scan_array(

struct surface_points *this_plot,

struct iso_curve ***first_ptr,

int *first_n, int *first_invert,

struct iso_curve ***second_ptr,

int *second_n, int *second_invert)

{

if (first_ptr) {

pm3d_rearrange_part(this_plot->iso_crvs, this_plot->num_iso_read, first_ptr, first_invert);

*first_n = this_plot->num_iso_read;

}

if (second_ptr) {

struct iso_curve *icrvs = this_plot->iso_crvs;

struct iso_curve *icrvs2;

int i;

/* advance until second part */

for (i = 0; i < this_plot->num_iso_read; i++)

icrvs = icrvs->next;

/* count the number of scans of second part */

for (i = 0, icrvs2 = icrvs; icrvs2; icrvs2 = icrvs2->next)

i++;

if (i > 0) {

*second_n = i;

pm3d_rearrange_part(icrvs, i, second_ptr, second_invert);

} else {

*second_ptr = (struct iso_curve **) 0;

}

static int compare_quadrangles(const void* v1, const void* v2)

{

const quadrangle* q1 = (const quadrangle*)v1;

const quadrangle* q2 = (const quadrangle*)v2;

if (q1->z > q2->z)

return 1;

else if (q1->z < q2->z)

return -1;

else

return 0;

}

void pm3d_depth_queue_clear(void)

{

if (pm3d.direction != PM3D_DEPTH)

return;

if (quadrangles)

free(quadrangles);

quadrangles = (quadrangle*)0;

allocated_quadrangles = 0;

current_quadrangle = 0;

}

void pm3d_depth_queue_flush(void)

{

if (pm3d.direction != PM3D_DEPTH)

return;

if (current_quadrangle > 0 && quadrangles) {

quadrangle* qp;

quadrangle* qe;

gpdPoint* gpdPtr;

gpiPoint* gpiPtr;

vertex out;

double z = 0; /* assignment keeps the compiler happy */

double w = trans_mat[3][3];

int i;

for (qp = quadrangles, qe = quadrangles + current_quadrangle; qp != qe; qp++) {

gpdPtr = qp->corners;

gpiPtr = qp->icorners;

for (i = 0; i < 4; i++, gpdPtr++, gpiPtr++) {

map3d_xyz(gpdPtr->x, gpdPtr->y, gpdPtr->z, &out);

if (i == 0 || out.z > z)

z = out.z;

gpiPtr->x = (unsigned int) ((out.x * xscaler / w) + xmiddle);

gpiPtr->y = (unsigned int) ((out.y * yscaler / w) + ymiddle);

}

qp->z = z; /* maximal z value of all four corners */

}

qsort(quadrangles, current_quadrangle, sizeof (quadrangle), compare_quadrangles);

for (qp = quadrangles, qe = quadrangles + current_quadrangle; qp != qe; qp++) {

set_color(qp->gray);

ifilled_quadrangle(qp->icorners);

}

pm3d_depth_queue_clear();

}

* Now the implementation of the pm3d (s)plotting mode

* Note: the input parameter at_which_z is char, but an old HP cc requires

* ANSI C K&R routines with int only.

static void

pm3d_plot(struct surface_points *this_plot, int at_which_z)

{

int j, i, i1, ii, ii1, from, curve, scan, up_to, up_to_minus, invert = 0;

int go_over_pts, max_pts;

int are_ftriangles, ftriangles_low_pt = -999, ftriangles_high_pt = -999;

struct iso_curve *scanA, *scanB;

struct coordinate GPHUGE *pointsA, *pointsB;

struct iso_curve **scan_array;

int scan_array_n;

double avgC, gray;

double cb1, cb2, cb3, cb4;

gpdPoint corners[4];

int interp_i, interp_j;

#ifdef EXTENDED_COLOR_SPECS

gpiPoint icorners[4];

#endif

gpdPoint **bl_point = NULL; /* used for bilinear interpolation */

/* just a shortcut */

TBOOLEAN color_from_column = this_plot->pm3d_color_from_column;

if (this_plot == NULL)

return;

if (at_which_z != PM3D_AT_BASE && at_which_z != PM3D_AT_TOP && at_which_z != PM3D_AT_SURFACE)

return;

/* return if the terminal does not support filled polygons */

if (!term->filled_polygon)

return;

switch (at_which_z) {

case PM3D_AT_BASE:

corners[0].z = corners[1].z = corners[2].z = corners[3].z = base_z;

break;

case PM3D_AT_TOP:

corners[0].z = corners[1].z = corners[2].z = corners[3].z = ceiling_z;

break;

/* the 3rd possibility is surface, PM3D_AT_SURFACE, coded below */

}

scanA = this_plot->iso_crvs;

curve = 0;

pm3d_rearrange_scan_array(this_plot, &scan_array, &scan_array_n, &invert, (struct iso_curve ***) 0, (int *) 0, (int *) 0);

interp_i = pm3d.interp_i;

interp_j = pm3d.interp_j;

if (interp_i <= 0 || interp_j <= 0) {

/* Number of interpolations will be determined from desired number of points.

Search for number of scans and maximal number of points in a scan for points

which will be plotted (INRANGE). Then set interp_i,j so that number of points

will be a bit larger than |interp_i,j|.

If (interp_i,j==0) => set this number of points according to DEFAULT_OPTIMAL_NB_POINTS.

Ideally this should be comparable to the resulution of the output device, which

can hardly by done at this high level instead of the driver level.

#define DEFAULT_OPTIMAL_NB_POINTS 200

int max_scan_pts = 0;

int max_scans = 0;

int pts;

for (scan = 0; scan < this_plot->num_iso_read - 1; scan++) {

scanA = scan_array[scan];

pointsA = scanA->points;

pts = 0;

for (j=0; j<scanA->p_count; j++)

if (pointsA[j].type == INRANGE) pts++;

if (pts > 0) {

max_scan_pts = GPMAX(max_scan_pts, pts);

max_scans++;

}

if (interp_i <= 0) {

ii = (interp_i == 0) ? DEFAULT_OPTIMAL_NB_POINTS : -interp_i;

interp_i = floor(ii / max_scan_pts) + 1;

}

if (interp_j <= 0) {

ii = (interp_j == 0) ? DEFAULT_OPTIMAL_NB_POINTS : -interp_j;

interp_j = floor(ii / max_scans) + 1;

}

#if 0

fprintf(stderr, "pm3d.interp_i=%i\t pm3d.interp_j=%i\n", pm3d.interp_i, pm3d.interp_j);

fprintf(stderr, "INRANGE: max_scans=%i max_scan_pts=%i\n", max_scans, max_scan_pts);

fprintf(stderr, "seting interp_i=%i\t interp_j=%i => there will be %i and %i points\n",

interp_i, interp_j, interp_i*max_scan_pts, interp_j*max_scans);

#endif

}

if (pm3d.direction == PM3D_DEPTH) {

for (scan = 0; scan < this_plot->num_iso_read - 1; scan++) {

scanA = scan_array[scan];

scanB = scan_array[scan + 1];

are_ftriangles = pm3d.ftriangles && (scanA->p_count != scanB->p_count);

if (!are_ftriangles)

allocated_quadrangles += GPMIN(scanA->p_count, scanB->p_count) - 1;

else {

allocated_quadrangles += GPMAX(scanA->p_count, scanB->p_count) - 1;

}

allocated_quadrangles *= (interp_i > 1) ? interp_i : 1;

allocated_quadrangles *= (interp_j > 1) ? interp_j : 1;

quadrangles = (quadrangle*)gp_realloc(quadrangles, allocated_quadrangles * sizeof (quadrangle), "pm3d_plot->quadrangles");

/* DEBUG: fprintf(stderr, "allocated_quadrangles = %d\n", allocated_quadrangles); */

}

/* pm3d_rearrange_scan_array(this_plot, (struct iso_curve***)0, (int*)0, &scan_array, &invert); */

#if 0

/* debugging: print scan_array */

for (scan = 0; scan < this_plot->num_iso_read; scan++) {

printf("**** SCAN=%d points=%d\n", scan, scan_array[scan]->p_count);

}

#endif

#if 0

/* debugging: this loop prints properties of all scans */

for (scan = 0; scan < this_plot->num_iso_read; scan++) {

struct coordinate GPHUGE *points;

scanA = scan_array[scan];

printf("\n#IsoCurve = scan nb %d, %d points\n#x y z type(in,out,undef)\n", scan, scanA->p_count);

for (i = 0, points = scanA->points; i < scanA->p_count; i++) {

printf("%g %g %g %c\n",

points[i].x, points[i].y, points[i].z, points[i].type == INRANGE ? 'i' : points[i].type == OUTRANGE ? 'o' : 'u');

/* Note: INRANGE, OUTRANGE, UNDEFINED */

}

printf("\n");

#endif

* if bilinear interpolation is enabled, allocate memory for the

* interpolated points here

if (interp_i > 1 || interp_j > 1) {

bl_point = (gpdPoint **)gp_alloc(sizeof(gpdPoint*) * (interp_i+1), "bl-interp along scan");

for (i1 = 0; i1 <= interp_i; i1++)

bl_point[i1] = (gpdPoint *)gp_alloc(sizeof(gpdPoint) * (interp_j+1), "bl-interp between scan");

}

* this loop does the pm3d draw of joining two curves

* How the loop below works:

* - scanB = scan last read; scanA = the previous one

* - link the scan from A to B, then move B to A, then read B, then draw

for (scan = 0; scan < this_plot->num_iso_read - 1; scan++) {

scanA = scan_array[scan];

scanB = scan_array[scan + 1];

FPRINTF((stderr,"\n#IsoCurveA = scan nb %d has %d points ScanB has %d points\n",

scan, scanA->p_count, scanB->p_count));

pointsA = scanA->points;

pointsB = scanB->points;

/* if the number of points in both scans is not the same, then the

* starting index (offset) of scan B according to the flushing setting

* has to be determined

from = 0; /* default is pm3d.flush==PM3D_FLUSH_BEGIN */

if (pm3d.flush == PM3D_FLUSH_END)

from = abs(scanA->p_count - scanB->p_count);

else if (pm3d.flush == PM3D_FLUSH_CENTER)

from = abs(scanA->p_count - scanB->p_count) / 2;

/* find the minimal number of points in both scans */

up_to = GPMIN(scanA->p_count, scanB->p_count) - 1;

up_to_minus = up_to - 1; /* calculate only once */

are_ftriangles = pm3d.ftriangles && (scanA->p_count != scanB->p_count);

if (!are_ftriangles)

go_over_pts = up_to;

else {

max_pts = GPMAX(scanA->p_count, scanB->p_count);

go_over_pts = max_pts - 1;

/* the j-subrange of quadrangles; in the remaing of the interval

* [0..up_to] the flushing triangles are to be drawn */

ftriangles_low_pt = from;

ftriangles_high_pt = from + up_to_minus;

}

/* Go over

* - the minimal number of points from both scans, if only quadrangles.

* - the maximal number of points from both scans if flush triangles

* (the missing points in the scan of lower nb of points will be

* duplicated from the begin/end points).

* Notice: if it would be once necessary to go over points in `backward'

* direction, then the loop body below would require to replace the data

* point indices `i' by `up_to-i' and `i+1' by `up_to-i-1'.

for (j = 0; j < go_over_pts; j++) {

/* Now i be the index of the scan with smaller number of points,

* ii of the scan with larger number of points. */

if (are_ftriangles && (j < ftriangles_low_pt || j > ftriangles_high_pt)) {

i = (j <= ftriangles_low_pt) ? 0 : ftriangles_high_pt-from+1;

ii = j;

i1 = i;

ii1 = ii + 1;

} else {

int jj = are_ftriangles ? j - from : j;

i = jj;

if (PM3D_SCANS_AUTOMATIC == pm3d.direction && invert)

i = up_to_minus - jj;

ii = i + from;

i1 = i + 1;

ii1 = ii + 1;

}

/* From here, i is index to scan A, ii to scan B */

if (scanA->p_count > scanB->p_count) {

int itmp = i;

i = ii;

ii = itmp;

itmp = i1;

i1 = ii1;

ii1 = itmp;

}

FPRINTF((stderr,"j=%i: i=%i i1=%i [%i] ii=%i ii1=%i [%i]\n",

j,i,i1,scanA->p_count,ii,ii1,scanB->p_count));

/* choose the clipping method */

if (pm3d.clip == PM3D_CLIP_4IN) {

/* (1) all 4 points of the quadrangle must be in x and y range */

if (!(pointsA[i].type == INRANGE && pointsA[i1].type == INRANGE &&

pointsB[ii].type == INRANGE && pointsB[ii1].type == INRANGE))

continue;

} else { /* (pm3d.clip == PM3D_CLIP_1IN) */

/* (2) all 4 points of the quadrangle must be defined */

if (pointsA[i].type == UNDEFINED || pointsA[i1].type == UNDEFINED ||

pointsB[ii].type == UNDEFINED || pointsB[ii1].type == UNDEFINED)

continue;

/* and at least 1 point of the quadrangle must be in x and y range */

if (pointsA[i].type == OUTRANGE && pointsA[i1].type == OUTRANGE &&

pointsB[ii].type == OUTRANGE && pointsB[ii1].type == OUTRANGE)

continue;

}

if ((interp_i <= 1 && interp_j <= 1) || pm3d.direction == PM3D_DEPTH) {

#ifdef EXTENDED_COLOR_SPECS

if (!supply_extended_color_specs) {

#endif

/* Get the gray as the average of the corner z- or gray-positions

(note: log scale is already included). The average is calculated here

if there is no interpolation (including the "pm3d depthorder" option),

otherwise it is done for each interpolated quadrangle later.

I always wonder what is faster: d*0.25 or d/4? Someone knows? -- 0.25 (joze) */

if (color_from_column) {

/* color is set in plot3d.c:get_3ddata() */

cb1 = pointsA[i].CRD_COLOR;

cb2 = pointsA[i1].CRD_COLOR;

cb3 = pointsB[ii].CRD_COLOR;

cb4 = pointsB[ii1].CRD_COLOR;

} else {

cb1 = z2cb(pointsA[i].z);

cb2 = z2cb(pointsA[i1].z);

cb3 = z2cb(pointsB[ii].z);

cb4 = z2cb(pointsB[ii1].z);

}

switch (pm3d.which_corner_color) {

case PM3D_WHICHCORNER_MEAN: avgC = (cb1 + cb2 + cb3 + cb4) * 0.25; break;

case PM3D_WHICHCORNER_GEOMEAN: avgC = geomean4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_MEDIAN: avgC = median4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_MIN: avgC = minimum4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_MAX: avgC = maximum4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_C1: avgC = cb1; break;

case PM3D_WHICHCORNER_C2: avgC = cb2; break;

case PM3D_WHICHCORNER_C3: avgC = cb3; break;

case PM3D_WHICHCORNER_C4: avgC = cb4; break;

default: int_error(NO_CARET, "cannot be here"); avgC = 0;

}

/* transform z value to gray, i.e. to interval [0,1] */

gray = cb2gray(avgC);

/* print the quadrangle with the given color */

FPRINTF((stderr, "averageColor %g\tgray=%g\tM %g %g L %g %g L %g %g L %g %g\n",

avgC, gray, pointsA[i].x, pointsA[i].y, pointsB[ii].x, pointsB[ii].y,

pointsB[ii1].x, pointsB[ii1].y, pointsA[i1].x, pointsA[i1].y));

/* set the color */

if (pm3d.direction != PM3D_DEPTH)

set_color(gray);

#ifdef EXTENDED_COLOR_SPECS

}

#endif

}

corners[0].x = pointsA[i].x;

corners[0].y = pointsA[i].y;

corners[1].x = pointsB[ii].x;

corners[1].y = pointsB[ii].y;

corners[2].x = pointsB[ii1].x;

corners[2].y = pointsB[ii1].y;

corners[3].x = pointsA[i1].x;

corners[3].y = pointsA[i1].y;

if (interp_i > 1 || interp_j > 1 || at_which_z == PM3D_AT_SURFACE) {

/* always supply the z value if

* EXTENDED_COLOR_SPECS is defined

corners[0].z = pointsA[i].z;

corners[1].z = pointsB[ii].z;

corners[2].z = pointsB[ii1].z;

corners[3].z = pointsA[i1].z;

if (color_from_column) {

corners[0].c = pointsA[i].CRD_COLOR;

corners[1].c = pointsB[ii].CRD_COLOR;

corners[2].c = pointsB[ii1].CRD_COLOR;

corners[3].c = pointsA[i1].CRD_COLOR;

}

#ifdef EXTENDED_COLOR_SPECS

if (supply_extended_color_specs) {

if (color_from_column) {

icorners[0].z = pointsA[i].CRD_COLOR;

icorners[1].z = pointsB[ii].CRD_COLOR;

icorners[2].z = pointsB[ii1].CRD_COLOR;

icorners[3].z = pointsA[i1].CRD_COLOR;

} else {

/* the target wants z and gray value */

icorners[0].z = pointsA[i].z;

icorners[1].z = pointsB[ii].z;

icorners[2].z = pointsB[ii1].z;

icorners[3].z = pointsA[i1].z;

}

for (i = 0; i < 4; i++) {

icorners[i].spec.gray =

cb2gray( color_from_column ? icorners[i].z : z2cb(icorners[i].z) );

}

if (pm3d.direction == PM3D_DEPTH) {

/* copy quadrangle */

quadrangle* qp = quadrangles + current_quadrangle;

memcpy(qp->corners, corners, 4 * sizeof (gpdPoint));

qp->gray = gray;

for (i = 0; i < 4; i++) {

qp->icorners[i].z = icorners[i].z;

qp->icorners[i].spec.gray = icorners[i].spec.gray;

}

current_quadrangle++;

} else

filled_quadrangle(corners, icorners);

#else

if (interp_i > 1 || interp_j > 1) {

/* Interpolation is enabled.

* interp_i is the # of points along scan lines

* interp_j is the # of points between scan lines

* Algorithm is to first sample i points along the scan lines

* defined by corners[3],corners[0] and corners[2],corners[1]. */

int j1;

for (i1 = 0; i1 <= interp_i; i1++) {

bl_point[i1][0].x =

((corners[3].x - corners[0].x) / interp_i) * i1 + corners[0].x;

bl_point[i1][interp_j].x =

((corners[2].x - corners[1].x) / interp_i) * i1 + corners[1].x;

bl_point[i1][0].y =

((corners[3].y - corners[0].y) / interp_i) * i1 + corners[0].y;

bl_point[i1][interp_j].y =

((corners[2].y - corners[1].y) / interp_i) * i1 + corners[1].y;

bl_point[i1][0].z =

((corners[3].z - corners[0].z) / interp_i) * i1 + corners[0].z;

bl_point[i1][interp_j].z =

((corners[2].z - corners[1].z) / interp_i) * i1 + corners[1].z;

if (color_from_column) {

bl_point[i1][0].c =

((corners[3].c - corners[0].c) / interp_i) * i1 + corners[0].c;

bl_point[i1][interp_j].c =

((corners[2].c - corners[1].c) / interp_i) * i1 + corners[1].c;

}

/* Next we sample j points between each of the new points

* created in the previous step (this samples between

* scan lines) in the same manner. */

for (j1 = 1; j1 < interp_j; j1++) {

bl_point[i1][j1].x =

((bl_point[i1][interp_j].x - bl_point[i1][0].x) / interp_j) *

j1 + bl_point[i1][0].x;

bl_point[i1][j1].y =

((bl_point[i1][interp_j].y - bl_point[i1][0].y) / interp_j) *

j1 + bl_point[i1][0].y;

bl_point[i1][j1].z =

((bl_point[i1][interp_j].z - bl_point[i1][0].z) / interp_j) *

j1 + bl_point[i1][0].z;

if (color_from_column)

bl_point[i1][j1].c =

((bl_point[i1][interp_j].c - bl_point[i1][0].c) / interp_j) *

j1 + bl_point[i1][0].c;

}

/* Once all points are created, move them into an appropriate

* structure and call set_color on each to retrieve the

* correct color mapping for this new sub-sampled quadrangle. */

for (i1 = 0; i1 < interp_i; i1++) {

for (j1 = 0; j1 < interp_j; j1++) {

corners[0].x = bl_point[i1][j1].x;

corners[0].y = bl_point[i1][j1].y;

corners[0].z = bl_point[i1][j1].z;

corners[1].x = bl_point[i1+1][j1].x;

corners[1].y = bl_point[i1+1][j1].y;

corners[1].z = bl_point[i1+1][j1].z;

corners[2].x = bl_point[i1+1][j1+1].x;

corners[2].y = bl_point[i1+1][j1+1].y;

corners[2].z = bl_point[i1+1][j1+1].z;

corners[3].x = bl_point[i1][j1+1].x;

corners[3].y = bl_point[i1][j1+1].y;

corners[3].z = bl_point[i1][j1+1].z;

if (color_from_column) {

corners[0].c = bl_point[i1][j1].c;

corners[1].c = bl_point[i1+1][j1].c;

corners[2].c = bl_point[i1+1][j1+1].c;

corners[3].c = bl_point[i1][j1+1].c;

}

FPRINTF((stderr,"(%g,%g),(%g,%g),(%g,%g),(%g,%g)\n",

corners[0].x, corners[0].y, corners[1].x, corners[1].y,

corners[2].x, corners[2].y, corners[3].x, corners[3].y));

/* If the colors are given separately, we already loaded them above */

if (!color_from_column) {

cb1 = z2cb(corners[0].z);

cb2 = z2cb(corners[1].z);

cb3 = z2cb(corners[2].z);

cb4 = z2cb(corners[3].z);

} else {

cb1 = corners[0].c;

cb2 = corners[1].c;

cb3 = corners[2].c;

cb4 = corners[3].c;

}

switch (pm3d.which_corner_color) {

case PM3D_WHICHCORNER_MEAN: avgC = (cb1 + cb2 + cb3 + cb4) * 0.25; break;

case PM3D_WHICHCORNER_GEOMEAN: avgC = geomean4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_MEDIAN: avgC = median4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_MIN: avgC = minimum4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_MAX: avgC = maximum4(cb1, cb2, cb3, cb4); break;

case PM3D_WHICHCORNER_C1: avgC = cb1; break;

case PM3D_WHICHCORNER_C2: avgC = cb2; break;

case PM3D_WHICHCORNER_C3: avgC = cb3; break;

case PM3D_WHICHCORNER_C4: avgC = cb4; break;

default: int_error(NO_CARET, "cannot be here"); avgC = 0;

}

/* transform z value to gray, i.e. to interval [0,1] */

gray = cb2gray(avgC);

if (pm3d.direction != PM3D_DEPTH) {

set_color(gray);

filled_quadrangle(corners);

} else {

/* copy quadrangle */

quadrangle* qp = quadrangles + current_quadrangle;

memcpy(qp->corners, corners, 4 * sizeof (gpdPoint));

qp->gray = gray;

current_quadrangle++;

}

} else { /* thus (interp_i == 1 && interp_j == 1) */

if (pm3d.direction != PM3D_DEPTH) {

filled_quadrangle(corners);

} else {

/* copy quadrangle */

quadrangle* qp = quadrangles + current_quadrangle;

memcpy(qp->corners, corners, 4 * sizeof (gpdPoint));

qp->gray = gray;

current_quadrangle++;

}

} /* interpolate between points */

#endif

} /* loop quadrangles over points of two subsequent scans */

} /* loop over scans */

if (bl_point) {

for (i1 = 0; i1 <= interp_i; i1++)

free(bl_point[i1]);

free(bl_point);

}

/* free memory allocated by scan_array */

free(scan_array);

} /* end of pm3d splotting mode */

* Now the implementation of the filled color contour plot

static void

filled_color_contour_plot(struct surface_points *this_plot, int contours_where)

{

double gray;

struct gnuplot_contours *cntr;

/* just a shortcut */

TBOOLEAN color_from_column = this_plot->pm3d_color_from_column;

if (this_plot == NULL || this_plot->contours == NULL)

return;

if (contours_where != CONTOUR_SRF && contours_where != CONTOUR_BASE)

return;

/* return if the terminal does not support filled polygons */

if (!term->filled_polygon)

return;

/* TODO: CHECK FOR NUMBER OF POINTS IN CONTOUR: IF TOO SMALL, THEN IGNORE! */

cntr = this_plot->contours;

while (cntr) {

printf("# Contour: points %i, z %g, label: %s\n", cntr->num_pts, cntr->coords[0].z, (cntr->label) ? cntr->label : "<no>");

if (cntr->isNewLevel) {

printf("\t...it isNewLevel\n");

/* contour split across chunks */

/* fprintf(gpoutfile, "\n# Contour %d, label: %s\n", number++, c->label); */

/* What is the color? */

/* get the z-coordinate */

/* transform contour z-coordinate value to gray, i.e. to interval [0,1] */

if (color_from_column)

gray = cb2gray(cntr->coords[0].CRD_COLOR);

else

gray = cb2gray( z2cb(cntr->coords[0].z) );

set_color(gray);

}

/* draw one countour */

if (contours_where == CONTOUR_SRF) /* at CONTOUR_SRF */

filled_polygon_3dcoords(cntr->num_pts, cntr->coords);

else /* at CONTOUR_BASE */

filled_polygon_3dcoords_zfixed(cntr->num_pts, cntr->coords, base_z);

/* next contour */

cntr = cntr->next;

}

} /* end of filled color contour plot splot mode */

* unset pm3d for the reset command

void

pm3d_reset()

{

strcpy(pm3d.where, "s");

pm3d.flush = PM3D_FLUSH_BEGIN;

pm3d.ftriangles = 0;

pm3d.direction = PM3D_SCANS_AUTOMATIC;

pm3d.clip = PM3D_CLIP_4IN;

pm3d.hidden3d_tag = 0;

pm3d.implicit = PM3D_EXPLICIT;

pm3d.which_corner_color = PM3D_WHICHCORNER_MEAN;

pm3d.interp_i = 1;

pm3d.interp_j = 1;

}

* Draw (one) PM3D color surface.

void

pm3d_draw_one(struct surface_points *plot)

{

int i = 0;

char *where = plot->pm3d_where[0] ? plot->pm3d_where : pm3d.where;

/* Draw either at 'where' option of the given surface or at pm3d.where

* global option. */

if (!where[0]) {

return;

}

/* for pm3dCompress.awk */

if (gppsfile && (pm3d.direction != PM3D_DEPTH))

fputs("%pm3d_map_begin\n", gppsfile);

for (; where[i]; i++) {

pm3d_plot(plot, where[i]);

}

if (strchr(where, 'C') != NULL) {

/* !!!!! FILLED COLOR CONTOURS, *UNDOCUMENTED*

!!!!! LATER CHANGE TO STH LIKE

!!!!! (if_filled_contours_requested)

!!!!! ...

Currently filled color contours do not work because gnuplot generates

open contour lines, i.e. not closed on the graph boundary.

if (draw_contour & CONTOUR_SRF)

filled_color_contour_plot(plot, CONTOUR_SRF);

if (draw_contour & CONTOUR_BASE)

filled_color_contour_plot(plot, CONTOUR_BASE);

}

/* for pm3dCompress.awk */

if (gppsfile && (pm3d.direction != PM3D_DEPTH))

View remainder of file in raw view

gnuplot-old/src/pm3d.c at gnuplot-4-4-alpha · gnuplot/gnuplot-old · GitHub

Repository navigation

Expand file tree

Breadcrumbs

pm3d.c

Latest commit

History

Breadcrumbs

pm3d.c

File metadata and controls